#include<bits/stdc++.h>
using namespace std;
int n,a,w,s;
int ka[1000005],kb[100005];
int sum;
int main()
{
sum=0;
for(int j=2;j*2<1000005;j++)
{
ka[j*2]=1;
}
sum=1;
kb[1]=2;
for(int i=3;i<=1000005;i++)
{
if(ka[i]==0)
{
sum++;
kb[sum]=i;
for(int j=3;j*kb[sum]<1000005;j+=2)
{
ka[j*kb[sum]]=1;
}
}
}
while(~scanf("%d",&n))
{
if(n==0)
{
break;
}
a=0;
for(w=1;kb[w]<=n/2;w++)
{
if(ka[n-kb[w]]==0)
{
s=n-kb[w];
a=1;
break;
}
}
if(a==1)
{
printf("%d = %d + %d\n",n,kb[w],s);
}
else
{
printf("Goldbach's conjecture is wrong");
}
}
return 0;
}