[POJ]2262

#include <iostream>

using namespace std;

 bool isPrimeNumber(int a)
{
    int i;
    for(i=2;i*i<=a;i++)
    {
        if(a%i==0)
           {
             //flag=0;
            return false;
           }
    }
    return true;
};

bool judge_prime(int digit)
{

    int i,flag;
    if(digit%2==0)
        return false;
    else
    {
        for(i=3,flag=1;i*i<=digit;i+=2)
            if(digit%i==0)
            {
                flag=0;
                break;
            }
        if(flag)
            return true;
    }
    return false;
}


int main()
{
    int k,flag=1;
    for(;;)
    {
        cin>>k;
        if(k<6||k%2!=0)
            return 0;
        int i,j;
        for(i=3;i<k;i++)
        {
            j=k-i;
            if(isPrimeNumber(i)&&isPrimeNumber(j))
            {
                cout<<k<<" = "<<i<<" + "<<j<<endl;
                flag=0;
                break;
            }
        }
        if(flag)
            cout<<"Goldbach's conjecture is wrong."<<endl;
    }
    return 0;
}