#include<iostream>
#include<math.h>
using namespace std;
#define max 1000000
bool isprime(int n)
{
for(int i=2;i<=(int)sqrt((double)n);i++)
if(n%i==0)
return false;
return true;
}
int main()
{
bool a[max];
int i,j,n;
bool flag;
memset(a,1,sizeof(a));
for(i=3;i<=(int)sqrt(double(max));i++)
{
if(isprime(i))
{
j=2;
while(j*i<=max)
{
a[j*i]=0;
j++;
}
}
else
a[i]=0;
}
while(cin>>n)
{
if(n)
{
flag=0;
for(i=3;i<n;i+=2)
if(a[i]&&a[n-i])
{
cout<<n<<" = "<<i<<" + "<<n-i<<endl;
flag=1;
break;
}
if(!flag)
cout<<"Goldbach's conjecture is wrong." <<endl;
}
else
break;
}
return 0;
}