//Eikasia tou Goldbach
//Goldbach's conjecture:Every even integer greater than 2 
//can be expressed as the sum of two primes 
#include <iostream>
using namespace std;

bool checkPrime(int n);

int main()
{
    int n, i;
    bool flag = false;

    cout << "Dose ena artio akeraio > 2: ";
    cin >> n;

    for(i = 2; i <= n/2; ++i)
    {
        if (checkPrime(i))
        {
            if (checkPrime(n - i))
            {
                cout << n << " = " << i << " + " << n-i << endl;
                flag = true;
            }
        }
    }

    if (!flag)
      cout << n << " den ekfrazetai san athroisma 2 prwtwn.";
    system("PAUSE"); 
    return 0;
}

// Elegxos gia prwto
bool checkPrime(int n)
{
    int i;
    bool isPrime = true;

    for(i = 2; i <= n/2; ++i)
    {
        if(n % i == 0)
        {
            isPrime = false;
            break;
        }
    }

    return isPrime;
}