#include<iostream>
#include<cmath>
using namespace std;
int isprime(int a)
{
	int flag=1;
	int i;
	for(i=2;i<=sqrt(double(a));i++)
	{
		if(a%i==0)
		{
			flag=0;
			break;
		}
	}
	return flag;
}

int main()
{int n,i,t,u;
while(cin>>n&&n)
{ t=0;
u=0;
for(int i=2;i<=n/2;i++)
{
		if(isprime(i)&&isprime(n-i))
		{
			t=i;
			u=n-i;
			cout<<n<<"="<<t<<"+"<<u<<endl;
			break;
		}
	 
}if(u==0)
		cout<<"Goldbach's conjecture is wrong"<<endl;
	
}
return 0;}