#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cmath>
using namespace std;
bool prime(int num)
{
	for (int i = 2; i <= sqrt(num); i++)
		if (num % i == 0) return false;
	return true;
}
int main()
{
	int n, i, j;
	cin >> n;
	for (i = 2; i <= n / 2; i++)//验证哥德巴赫猜想
	{
		j = n - i;
		if (prime(i) && prime(j))
		{
			cout << n << "=" << i << "+" << j << endl;
			break;
		}
	}
	return 0;
}

#include<iostream>
#include<set>
#include<algorithm>
using namespace std;
int main()
{
    int n;
    string s;
    string ans = "younik";
    cin >> n;
    set<string> S;//set容器（不重复）
    for (int i = 0; i < n; i++)
    {
        cin >> s;
        S.insert(s);
        if (s == ans)
        {
            printf("%d\n", S.size());
            break;
        }
    }
    return 0;
}

#include<iostream>
#include<stack>
#include<algorithm>
using namespace std;
int main()
{
    stack<char> q;//stack栈的简单应用
    string s;
    while (cin >> s)
    {
        string ans;
        for (int i = 0; i < s.size(); i++)
        {
            if (q.empty()) q.push(s[i]);
            else
            {
                if (s[i] == 'o' && q.top() == s[i])
                {
                    q.pop();
                    if (!q.empty())
                    {
                        if (q.top() == 'O')
                            q.pop();
                    }
                    else q.push('O');
                }
                else if (s[i] == 'O' && q.top() == s[i])
                {
                    q.pop();
                }
                else q.push(s[i]);
            }
        }
        while (!q.empty())
        {
            ans = q.top() + ans;
            q.pop();
        }
        printf("%s\n", ans.c_str());
    }
    return 0;
}