#include <stdio.h>

#define DBG(x)

#define WAIT while(getchar()==0)
#define MAX(a,b) ((a>b)?(a):(b))
#define MIN(a,b) ((a<b)?(a):(b))
#define SQR(x) ((x)*(x))
#define MAXI 256*256*256*127

int i,j,k,l,m,max,min,count,res,mp,z;
int p[1000000],prim[100000];
FILE *input;

int main()
{
input=fopen("goldbach.in","r");
count=0;

mp=1;
prim[0]=2;
for(i=3;i<1000000;i+=2)
{
p[i]=0;
for(j=0;j<mp;j++)
{
	if(i%prim[j]==0)goto weiter;
	if(prim[j]>1000) goto weiter;
}
p[i]=1;
prim[mp++]=i;
weiter: j;
}
fscanf(input,"%d",&z);
while(z>0)
{
	for(i=0;i<mp;i++)
	{
		if(p[z-prim[i]])
		{
			printf("%d = %d + %d\n",z,prim[i],z-prim[i]);
			goto hahaha;
		}
	}
printf("Goldbach's conjecture is wrong.\n");
hahaha:	
	fscanf(input,"%d",&z);
}

fclose(input);
return 0;
}