#include <iostream>
#include <math.h>
using namespace std;

bool isprime(int x)
{
	int i;
	double m=sqrt((double)x);
	for(i=2;i<=m;i++)
		if(x%i==0) return false;
	return true;
}

int main()
{
	int n,i;
	while(cin>>n && n)
	{
		bool flag=false;
		for(i=3;i<=n/2;i+=2)
			if(isprime(i) && isprime(n-i))
			{
				flag=true;
				break;
			}
		if(flag) cout<<n<<" = "<<i<<" + "<<n-i<<endl;
		else cout<<"Goldbach's conjecture is wrong."<<endl;

	}
	return 0;
}