int main()
{
	int sz[10000][2];
	double x,y;
	int i,j,row;
	scanf("%d",&row);
	for(i=0;i<row;i++)
		for(j=0;j<2;j++)
			scanf("%d",&sz[i][j]);
	x=(double)sz[0][1]/(double)sz[0][0];
	for(i=1;i<row;i++){
		y=(double)sz[i][1]/(double)sz[i][0];
		if(y-x>0.05){
			printf("better\n");
		}else if(x-y>0.05){
			printf("worse\n");
		}else{
			printf("same\n");
		}
	}
	return 0;
}


int main(){
	int n,i,cases[100][3];
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d %d",&cases[i][0],&cases[i][1]);
		cases[i][2]=100*cases[i][1]/cases[i][0];
	}
	for(i=1;i<n;i++){
		if(cases[i][2]-cases[0][2]>=5)printf("better\n");
		else if(cases[0][2]-cases[i][2]>=5)printf("worse\n");
		else printf("same\n");
	}
	return 0;
}


int main()
{
	int i,n;
	double a,b;
	double x,y;
	double another,effect;
	cin>>n;
	cin>>a>>b;
	effect=b/a;
	for(i=1;i<n;i++)
	{
		cin>>x>>y;
		another=y/x;
		if(another-effect>0.05)
		{
			cout<<"better"<<endl;
		}
		if(effect-another>0.05)
		{
			cout<<"worse"<<endl;
		}
		if(fabs(another-effect)<=0.05)
		{
			cout<<"same"<<endl;
		}
	}
	return 0;
}


int main() {
int n;
double y[500] = {0}, a, b;
cin >> n;
cin >> a >> b;
y[0] = b / a;
for (int i = 1; i < n; i++) {
cin >> a >> b;
y[i] = b / a;
if (y[i] - y[0] > 0.05) { cout << "better";}
else if (y[0] - y[i] > 0.05) { cout << "worse";}
else { cout << "same";}
cout << endl;
}
return 0;
}


int main()
{
int i,n,x,y,a,c,d,e,b;
scanf("%d",&n);
scanf("%d %d",&a,&b);
c=100*b/a;
for(i=1;i<n;i++){
    scanf("%d %d",&x,&y);
	d=100*y/x;
	e=d-c;
	if(e>=5)
		printf("better\n");
	else if(e<=-5){
		printf("worse\n");
	}
	else{
		printf("same\n");
	}
}

return 0;
}


int main()
{
	int n;
	double jsum,juse,a;
	int i,j;
	double xsum[100],xuse[100];
	scanf("%d",&n);
    scanf("%lf %lf",&jsum,&juse);
	a=juse/jsum;
    for(i=0;i<n-1;i++)
	{
		scanf("%lf %lf",&xsum[i],&xuse[i]);
	}
	for(j=0;j<n-1;j++)
	{
		if(((xuse[j]/xsum[j])-a)>0.05)
		{
			printf("better\n");
		}
		else if(((a-xuse[j]/xsum[j]))>0.05)
		{
			printf("worse\n");
		}
		else
			printf("same\n");
	}
	return 0;
}


int main()
{
	int n, x, y, i;
	double p, m;
	scanf("%d",&n);
	for(i=0;i<1;i++)
	{
		scanf("%d%d\n",&x,&y);
		p=100*((double)y)/((double)x);
	}
	for(i=1;i<n;i++)
	{
		scanf("%d%d",&x, &y);
		m=100*((double)y)/((double)x);
		if(p>m+5)
		{
			printf("worse\n");
		}
		else if(p<m-5)
		{
			printf("better\n");
		}
		else{
			printf("same\n");
		}
	}
	return 0;
}


double a,b,c,d;
double limit = 0.05;
int n;
int main()
{
	scanf("%d",&n);
	scanf("%lf%lf",&a,&b);
	double t = b / a;
//	int temp = t * 100;
	//printf("%d\n",temp);
	for(int i = 1;i < n;i ++){
		scanf("%lf%lf",&c,&d);
		double t1 = d / c;
	//	printf("%d\n",t1);
	//	printf("%d\n",abs(t1 - temp));
		if(t1 - t > limit) printf("better\n");
		else if(t - t1 > limit) printf("worse\n");
		else printf("same\n");
	}
	return 0;
}


int main(){
    int n,i,y,z;
	double m;
	int s[1000],x[1000];
	double you[1000];
	scanf("%d",&n);
    scanf("%d%d",&z,&y);
	m=100.0*y/z;
	for(i=0;i<n-1;i++){
		scanf("%d%d",&s[i],&x[i]);
		you[i]=100.0*x[i]/s[i];

		if(you[i]-m>5){
			printf("better\n");
		}else if(m-you[i]>5){
			printf("worse\n");
		}else{
			printf("same\n");
		}
	}
	return 0;
}


int main(int argc, char* argv[])
{
	int n,i,j;
	float a,b;
	int num[100][2];
	scanf("%d",&n);
	for(i=0;i<n;i++){
		for(j=0;j<2;j++){
			scanf("%d",&num[i][j]);
		}
	}
	a=(float)num[0][1]*100/num[0][0];

    for(i=1;i<n;i++){
		b=(float)num[i][1]*100/num[i][0];
		if(b-a>5){
			printf("better\n");
			}
		else if(a-b>5){
			printf("worse\n");
		}
		else{
			printf("same\n");
		}
	}
	return 0;
}


void main()
{ int i,j,n;
	int a,b,c,d;
	double e,f;
	scanf("%d",&n);
	scanf("%d%d",&a,&b);
	e=(double)b/a;
	for(i=1;i<n;i++){
	scanf("%d%d",&c,&d);
	f=(double)d/c;
	if(f-e>0.05) printf("better\n");
	else {
		if(e-f>0.05) printf("worse\n");
		else printf("same\n");}}

}


int main()
{
	int i,n,zong,hao;
	double x0,x;

	scanf(" %d",&n);
	scanf(" %d %d",&zong,&hao);
	x0=hao/(zong*1.0);

	for(i=0;i<n-1;i++)
	{
		scanf(" %d %d",&zong,&hao);
		x=hao/(zong*1.0);
		if(x-x0>0.05) printf("better\n");
		else if(x0-x>0.05) printf("worse\n");
		else printf("same\n");
	}

	return 0;
}


int main()
{
	int n, total, valid;
	float x, y;
	cin >> n;
	cin >> total >> valid;
	x = (float)valid / total;
	for (int i = 1; i <= n-1; i++)
	{
		cin >> total >> valid;
		y = (float)valid / total;
		if (y - x > 0.05)
		{
			cout << "better" << endl;
		}
		else
		{
			if (y - x < -0.05)
			{
				cout << "worse" << endl;
			}
			else cout << "same" << endl;
		}
	}
	return 0;
}


int main()
{
	int n,i;
	double a,b,c;
	cin>>n;
	cin>>a>>b;
	c=b/a;
	for(i=0;i<n-1;i++)
	{
		cin>>a>>b;
		if(b/a-c>0.05)
			cout<<"better"<<endl;
		if(b/a-c<-0.05)
			cout<<"worse"<<endl;
		if(b/a-c>=-0.05&&b/a-c<=0.05)
			cout<<"same"<<endl;
	}
	return 0;
}


int main(){
	int n,a,b,i,m;
	double x,z;
	double y[100];
	double sz[100];
	scanf("%d%d%d",&n,&a,&b);
	x=1.0*b/a;
	m=2*n-2;
	for(i=0;i<m;i++)
	{
		scanf("%lf",&(sz[i]));
	}
	for(i=0;i<m;i=i+2)
	{
		y[i]=sz[i+1]/sz[i];
	}
	for(i=0;i<m;i=i+2)
	{
		z=y[i]-x;
		if(z>0.05)
		{
			printf("better\n");
		}
		else if(-z>0.05)
		{
			printf("worse\n");
		}
		else{
			printf("same\n");
		}

	}
	return 0;
}


int main()
{
	double total[10000],valid[10000],t1,v1,std,x[10000];
	int n;
	cin>>n;
	cin>>t1>>v1;
	std=v1/t1;
	for(int i=0;i<n-1;i++)
	{
		cin>>total[i]>>valid[i];
		x[i]=valid[i]/total[i];
		if(std-x[i]>0.05)
			cout<<"worse"<<endl;
		if(x[i]-std>0.05)
			cout<<"better"<<endl;
		if((std-x[i]<=0.05&&std-x[i]>=0)||(x[i]-std<=0.05&&x[i]-std>=0))
			cout<<"same"<<endl;
	}
	return 0;
}


int main()
{
int n,i;
float a,b,p;
scanf("%d",&n);
scanf("%f%f",&a,&b);
p=b/a;
for(i=0;i<n-1;i++)
{
scanf("%f%f",&a,&b);
if(b/a-p>0.05) printf("better\n");
if(p-b/a>0.05) printf("worse\n");
if(p-b/a<=0.05&&b/a-p<=0.05) printf("same\n");
}
return 0;
}


int main()
{
    int n,i;

	float c,d;
	int a,b;

	scanf("%d",&n);
	scanf("%d%d",&a,&b);
	c=(float)b/a;
	scanf("%d%d",&a,&b);
		d=(float)b/a;
		if(d-c>0.05) printf("\nbetter");
		else if (c-d>0.05) printf("\nworse");
		else printf("\nsame");

    for (i=2;i<n;i++){
		scanf("%d%d",&a,&b);
		d=(float)b/a;
		if(d-c>0.05) printf("\nbetter");
		else if (c-d>0.05) printf("\nworse");
		else printf("\nsame");

		}

	return 0;
}


int main()
{
	int n,i;
	double jiwei1,jiwei2,jiweiyx;
	double a[100],b[100],c[100];
	scanf("%d",&n);

    scanf("%lf %lf",&jiwei1,&jiwei2);
	jiweiyx=(jiwei2/jiwei1)*100;

	for(i=0;i<n-1;i++)
	{
		scanf("%lf %lf",&a[i],&b[i]);
		c[i]=(b[i]/a[i])*100;
		if(c[i]-jiweiyx>=5)
		{
			printf("better\n");
		}
		if(jiweiyx-c[i]>=5)
		{
			printf("worse\n");
		}
		if(jiweiyx-c[i]<=5&&c[i]-jiweiyx<=5) printf("same\n");
	}

	return 0;
}


int main(){
	int i=0,n;
	scanf("%d",&n);
	double*za=(double*)malloc(sizeof(double)*n);
	int*a=(int*)malloc(sizeof(int)*n);
	int*b=(int*)malloc(sizeof(int)*n);
	if(i==0){
		scanf("%d%d",&a[i],&b[i]);
		za[i]=1.0*b[i]/a[i];
	}
	for(i=1;i<n;i++){
		scanf("%d%d",&a[i],&b[i]);
		za[i]=1.0*b[i]/a[i];
		if(za[i]-za[0]>0.05){
			printf("better\n");
		}else if(za[0]-za[i]>0.05){
			printf("worse\n");
		}else{
			printf("same\n");
		}
	}
	free(za);
	free(a);
	free(b);

	return 0;
}


int main(){
	int n,i;
	int a,b,c,d;
	scanf("%d",&n);
	scanf("%d%d",&a,&b);
	for(i=1;i<n;i++){
		scanf("%d%d",&c,&d);
        if((double)d/c-(double)b/a>0.05){
			printf("better\n");
		}else if((double)b/a-(double)d/c>0.05){
			printf("worse\n");
		}else{
            printf("same\n");
		}
	}

	return 0;
}


int main()
{
	int i,n;
	double a1,a2,b1[100],b2[100],d[100],c;
	char jieguo[100][7],jieguo1[7]="better",jieguo2[7]="worse",jieguo3[7]="same";
	scanf("%d",&n);
	scanf("%lf%lf",&a1,&a2);
	c=a2/a1;
	for(i=0;i<n-1;i++)
	{
		scanf("%lf%lf",&b1[i],&b2[i]);
		d[i]=b2[i]/b1[i];
		if(d[i]-c>0.05)
		{
			strcpy(jieguo[i],jieguo1);
		}
		else if(c-d[i]>0.05)
		{
			strcpy(jieguo[i],jieguo2);
		}
		else
		{
			strcpy(jieguo[i],jieguo3);
		}
	}
	for(i=0;i<n-2;i++)
	{
		printf("%s\n",jieguo[i]);
	}
	printf("%s",jieguo[n-2]);
	return 0;
}


int main()
{
int n, i, ZS[NUMBER], YX[NUMBER];
double x, y;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d",&ZS[i],&YX[i]);}
x=(1.000*YX[0])/ZS[0];
for(i=1;i<n;i++){
y=(1.000*YX[i])/ZS[i];
if(y-x>0.05){
printf("better\n");}
else if(x-y>0.05){
printf("worse\n");}
else{
printf("same\n");}
}
return 0;
}


void main()
{
	int i,n;
	double l[100],a,b,t;
	scanf("%d",&n);
	scanf("%lf%lf",&a,&b);
	l[0]=b/a;
	for(i=1;i<n;i++)
	{
		scanf("%lf%lf",&a,&b);
		l[i]=b/a;
		t=100*(l[i]-l[0]);
		if(t<-5)printf("worse\n");
		else if(t<=5)printf("same\n");
		else if(t>5)printf("better\n");
	}
	scanf("%d",&n);
}


/*???2011-12-30
 *??????
 *????09.cpp
 *????? - ??(4-9) ?????
 */

int main()
{
	int n = 0;
	double total = 0;
	double valid = 0;
	double cocktail = 0.0;
	cin >> n;
	cin >> total >> valid;
	cocktail = valid / total;
	for (int temp = 1; temp < n; temp++)
	{
		cin >> total >> valid;
		if ( (valid / total) > cocktail + 0.05 )
			cout << "better" << endl;
		else if ( (valid / total) < cocktail - 0.05 )
			cout << "worse" << endl;
		else
			cout << "same" << endl;
	}
	return 0;
}


int main()
{
	int n,i,total[100],youxiao[100];
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d %d",&total[i],&youxiao[i]);
	}
	double x=1.0*youxiao[0]/total[0];
	double y[100];
	for(i=1;i<n;i++)
	{
		y[i]=1.0*youxiao[i]/total[i];
	}
	for(i=1;i<n;i++)
	{
		if(y[i]-x>0.05)
		{printf("better\n");}
		else if(x-y[i]>0.05)
		{printf("worse\n");}
		else
		{printf("same\n");}
	}
	return 0;
}


int main(){
	int n,x,y,i;
	double jiwei,tmp;
	scanf("%d",&n);
	scanf("%d%d",&x,&y);
	jiwei=1.0*y/x;
	for (i=1;i<n;i++)
		{
		scanf("%d%d",&x,&y);
		tmp=1.0*y/x;
		if (tmp-jiwei>0.05)
			printf("better\n");
		else if (jiwei-tmp>0.05)
			printf("worse\n");
			else printf("same\n");
		}
	return 0;
}


int main()
{
    int n;
    cin >> n;
    double a,b;
    cin >> a >> b;
    double c;
    c=b/a;
    int i=1;
    while(i<n)
    {
       i++;
       double m,n;
       cin >> m >> n;
       double d=n/m;
       if((c-d)>0.05)
       {
         cout << "worse" << endl;
       }
       else if((d-c)>0.05)
       {
         cout << "better" << endl;
       }
       else
       {
           cout << "same" << endl;
       }
    }
    cin.get();cin.get();cin.get();
    return 0;
}


int main(){
	int n,i;
	double a,b;
	scanf("%d",&n);
	struct lf{
		int x,y;
	}*lfs;
	lfs=(struct lf*)malloc(sizeof(struct lf)*n);
	for (i=0;i<n;i++){
		scanf("%d%d",&(lfs[i].x),&(lfs[i].y));
	}
	a=(1.0*(lfs[0].y))/(lfs[0].x);
	for (i=1;i<n;i++){
		b=(1.0*(lfs[i].y))/(lfs[i].x);
		if (b-a>0.05){
			printf("\nbetter");
		}else if(a-b>0.05){
			printf("\nworse");
		}else{
			printf("\nsame");
		}
	}
	return 0;
}


int main()
{
	int n;
	scanf("%d",&n);
	int p, q;
	scanf("%d %d",&p,&q);
	float e = (float)q/p;
	int i = 2;
	while(i<=n)
	{
		int x, y;
		scanf("%d %d",&x,&y);
	    float f = (float)y/x;
		if((f-e<=0.05)&&(f-e>=-0.05))
			printf("same\n");
		else if(f<e)
			printf("worse\n");
		else
			printf("better\n");
		i++;
	}
	return 0;
}


int main()
{int n,i;
	double a,b,c[100];
	scanf("%d",&n);
	for(i=0;i<n;i++){scanf("%lf %lf",&a,&b);c[i]=b/a;}
	for(i=1;i<n;i++){if(c[i]-c[0]>0.05)printf("better\n");
		else if(c[0]-c[i]>0.05)printf("worse\n");
		else{printf("same\n");}}

}


int main()
{
     int n;
     scanf("%d",&n);
     int a0,b0;
     scanf("%d %d",&a0,&b0);
     double d=(double)b0/a0;
     for(int i=0;i<n-1;i++)
     {
           int a,b;
           scanf("%d %d",&a,&b);
           double c=(double)b/a;
           if(d>=c)
           {
                if(d-c>0.05) printf("worse\n");
                else printf("same\n");
           }
           else
          {
               if(c-d>0.05) printf("better\n");
               else printf("same\n");
          }
     }
}


int main()
{
	double n=0,i=0,p=0,q=0,x=0,y=0;
	double z=0,w=0;
	cin >> n >> p >> q;
	z=q/p;
	for(i=1;i<n;i=i+1)
	{
		cin >> x >> y;
		w=y/x;
	if (w-z>=0.05)
		cout << "better"<<endl;
	else
	{
		if(z-w>=0.05)
		cout << "worse" <<endl;
		else
			cout <<"same" <<endl;
	}
	}
	return 0;
}


int main()
{
int n,i;
float a,b,c,d,x,y,e,f;
scanf("%d",&n);
scanf("%d %d",&a,&b);
x=b/a;
for (i=1;i<n;i++){
scanf("%d %d",&c,&d);
y=d/c;
e=y-x;
f=x-y;
if (e>0.05) printf("better\n");
else if (f>0.05) printf("worse\n");
else if (e<=0.05&&f<=0.05) printf("same\n");
}
return 0;
}


void main()
{
	int n=0;
	int i=0;
	float zs_1=0,yx_1=0;
	float zs=0,yx=0;
	scanf("%d",&n);
	scanf("%f%f",&zs_1,&yx_1);
	for(i=1;i<n;i++)
	{
		scanf("%f%f",&zs,&yx);
		if((yx_1/zs_1-yx/zs)>0.05)
			printf("worse\n");
		else if((yx/zs-yx_1/zs_1)<0.05)
			printf("same\n");
		else
			printf("better\n");
		yx=0;
		zs=0;
	}
}


int main()
{
    int n;
    scanf("%d",&n);
    int sz[n][2];
    double p[n];
    int i,j;
    for(i=0;i<n;i++){
        scanf("%d %d\n",&sz[i][0],&sz[i][1]);
        p[i]=(double)sz[i][1]/sz[i][0];
    }
    for(i=1;i<n;i++){
       if(p[i]-p[0]>0.05){
          printf("better\n");
       }
       else if(p[0]-p[i]>0.05){
          printf("worse\n");
       }
       else{
          printf("same\n");
       }
    }
    return 0;
}


float ample[N][2], effect[N];
int main()
{
	int n;
	cin>>n;
	float ample0=0, ample1=0, effect0=0;
	cin>>ample0>>ample1;
	effect0=ample1/ample0;
	for(int i=0; i<n-1; i++)
	{
		cin>>ample[i][0]>>ample[i][1];
		effect[i]=ample[i][1]/ample[i][0];
		if(effect0-effect[i]>0.05) cout<<"worse"<<endl;
		else if(effect[i]-effect0>0.05) cout<<"better"<<endl;
		else cout<<"same"<<endl;
	}
	return 0;
}


int main()
{
	int n,zong[N],xiao[N],k;
	double x,y[N];
	scanf("%d",&n);
	for(k=0;k<n;k++){
		scanf("%d %d",&zong[k],&xiao[k]);
	}
	x=1.0*xiao[0]/zong[0];
	for(k=1;k<n;k++){
		y[k]=1.0*xiao[k]/zong[k];
		if(y[k]-x>0.05){
			printf("better\n");
		}else if(x-y[k]>0.05){
			printf("worse\n");
		}else{
			printf("same\n");
		}
	}
	return 0;
}


int main()
{
	int n,i;
	double a,b;
	double sz[100];
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf",&a);
		scanf("%lf",&b);
		sz[i]=b/a;
	}
	for(i=1;i<n;i++)
	{
		if((sz[i]-sz[0])>0.05)
		{
			printf("better\n");
		}
		else if((sz[0]-sz[i])>0.05)
		{
			printf("worse\n");
		}
		else
		{
			printf("same\n");
		}
	}
	return 0;
}


int main()
{
	int n,i;
	struct jiegou
	{
		int a;
		int b;
		float x;

	}
	sz[100];
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d %d",&sz[i].a,&sz[i].b);
		sz[i].x=(float)1.0*sz[i].b/sz[i].a*100.0;
	}
	for(i=1;i<n;i++)
	{
		if(sz[i].x-sz[0].x>5)
			printf("better\n");
		else if(sz[0].x-sz[i].x>5)
			printf("worse\n");
		else
			printf("same\n");
	}
	return 0;
}


main()
{
  int n;
  scanf("%d",&n);
  int i;
  double m0,m,x,a[n+1],b[n+1],t0,t;
  for(i=0;i<n;i++)
    scanf("%lf %lf",&a[i],&b[i]);
  t0 = a[0] - b[0];
  m0 = t0 / a[0];
  for(i=1;i<n;i++)
  {
    t = a[i] - b[i];
    m = t/a[i];
    if(m >= m0)
    {
      x = m - m0;
      if(x > 0.05)
        printf("worse\n");
      else
        printf("same\n");
    }
    else
    {
      x = m0 - m;
      if(x >0.05)
         printf("better\n");
      else
        printf("same\n");
     }
  }
}


/*
 * file    practice 1_6
 * author  ??
 * date    2010-11-12
 * description
           ????????????
*/

int main()
{
	int n, x, y, i;
	float a0, a;
	cin >> n;
	cin >> y >> x;
	a0 = x / 1.0 / y;
	for (i = 1; i <= n - 1; i ++)
	{
		cin >> y >> x;
		a = x / 1.0 / y;
		if (a - a0 > 0.05)
			cout << "better" << endl;
		else
			if (a - a0 < -0.05)
				cout << "worse" <<endl;
			else
				cout << "same" << endl;
	}
	return 0;
}


int main()
{
	double*y;
	int M,m,i,n;

	scanf("%d",&n);
	y=(double*)malloc(sizeof(double)*n);
	double x;
	scanf("%d%d",&M,&m);

	x=(double)m/M;

	for(i=0;i<n-1;i++)
	{
		scanf("%d%d",&M,&m);

			y[i]=(double)m/M;
	}
	for(i=0;i<n-1;i++)
	{
			if(x-y[i]>0.05)
			{
				printf("worse\n");
			}

			else
			{
				if(y[i]-x>0.05)
				{
				printf("better\n");
				}

			    else
				{
				printf("same\n");

				}
			}
	}

	free(y);

	return 0;
}


int main()
{
    int n,i;                            //???n???i
    cin>>n;
    float s_all,s_good;                 //strandard
    cin>>s_all>>s_good;                 //???
    float all,good;                     //?????????
    for (i=1;i<=n-1;i++)
    {
        cin>>all>>good;
        if (s_good/s_all-good/all>0.05) //????~
           cout<<"worse"<<endl;
        else if (good/all-s_good/s_all>0.05)
           cout<<"better"<<'\n';
        else
           cout<<"same"<<'\n';
    }
    return 0;                           //?? (>w<)
}


int main()
{
	int n;
	cin >> n;
	int testnum, successnum;
	float x = 0, y = 0;

	for (int i = 1; i <= n; i++)
	{
		cin >> testnum >> successnum;
		if (i == 1)
		{
			x = 100.0 * successnum / testnum;
		}
		if (i >= 2)
		{
			y = 100.0 * successnum / testnum;
			if ((int)(y - x) >= 5)
			{
				cout << "better" << endl;
			}
			else if ((int)(x - y) >= 5)
			{
				cout << "worse" << endl;
			}
			else
			{
				cout << "same" << endl;
			}
		}
		y = 0;
	}

	return 0;
}


int main()
{
	int n,i;
	double x,y;
	scanf("%d",&n);
	int **sz=(int**)malloc(sizeof(int*)*n);
	for(i=0;i<n;i++)
	{
		sz[i]=(int*)malloc(sizeof(int)*2);
		scanf("%d %d",&sz[i][0],&sz[i][1]);
	}
	x=1.0*sz[0][1]/sz[0][0];
	for(i=1;i<n;i++)
	{
		y=1.0*sz[i][1]/sz[i][0];
		if(y-x>0.05)
		{
			printf("better\n");
		}
		else if(x-y>0.05)
		{
			printf("worse\n");
		}
		else
		{
			printf("same\n");
		}
	}
	return 0;
}


int main()
{
	int n, a, b, m, p, k= 0;
	double x, y;
	cin >> n;
	cin >> m >> p;
	x = (double)p / m;
	for(k = 1; k < n; k++)
	{
		cin >> a >> b;
	    y = (double)b / a;
		if(y - x > 0.05)
			cout << "better" << endl;
	    if(x - y > 0.05)
			cout << "worse" << endl;
		if((y - x <= 0.05)&&(x - y <= 0.05))
			cout << "same" << endl;
	}
return 0;
}


int main()
{
    int m,w;
    double v[2];
    double p[2];
    double v0,p0,c;
    scanf("%d",&m);
    scanf("%lf %lf",v,v+1);
    v0=v[1]/v[0];
    m--;
    for(w=0;w<m;w++)
    {
        scanf("%lf %lf",p,p+1);
        p0=p[1]/p[0];
        c=p0-v0;
        if(c>0.05)
        printf("better\n");
        else
        {
            if(c<-0.05)
            printf("worse\n");
            else
            printf("same\n");
        }
    }
    return 0;
}


void main()
{
	int cases;
	double x,y,rate;
	scanf("%d",&cases);
	cases--;
	scanf("%lf %lf",&x,&y);
	rate=y/x;
	while(cases--){
		scanf("%lf %lf",&x,&y);
		if(y/x-rate>0.05)printf("better\n");
		else if(rate-y/x>0.05)printf("worse\n");
		else printf("same\n");
	}
}


int main()
{
 int n,i,j,pd(int x);
 scanf ("%d",&n);
 for (i=6;i<=n;i+=2)
  {
   for (j=3;j<=0.5*i;j=j+2)
   {
    if (pd(j) && pd(i-j))
    {
     printf("%d=%d+%d\n",i,j,i-j);
     break;
    }

   }
  }
}
int pd(int x)
{
 int i;
 float y;y=x;
 for (i=3;i<=(int)sqrt(y);i+=2)
  {
   if (x%i==0) return 0;
  }
 return 1;
}


int veget(int m)
{
	int a,i;
	a=1;
	for(i=2;i<=(int)sqrt(m);i++)
	{
		if(m%i==0)
		{
			a=0;
			break;
		}
	}
	return(a);
}
main()
{
  int i,j,n;
  scanf("%d",&n);
  for(i=6;i<=n;i=i+2)
  {
	  for(j=3;j<=i/2;j++)
	  {
		  if(veget(j)==1&&veget(i-j)==1) break;
	  }
	  printf("%d=%d+%d\n",i,j,i-j);
  }

}


int a[100000]={0};
int f(int y)
{
	int t,i;
	t=sqrt(y);
    for(i=2;i<=t;i++)
	{
			if(y%i==0)
				break;
	}
	if(i>t)
	    return 1;
	else
		return 0;
}
int main(int argc, char* argv[])
{
	int n,z;
	scanf("%d",&n);
	int i,j,k,x=0;
	for(j=2;j<=n;j++)
	{
		k=sqrt(j);
		for(z=2;z<=k;z++)
		{
			if(j%z==0)
				break;
		}
		if(z>k)
		{
			a[x]=j;
			x++;
		}
	}
	for(i=6;i<=n;i+=2)
	{
		for(j=0;j<=x;j++)
		{
			if(f(i-a[j]))
			{
				printf("%d=%d+%d\n",i,a[j],i-a[j]);
				break;
			}
		}
		continue;

	}
	return 0;
}


int sushu(int a)
{
	int i;
	double b;
	b=sqrt(a);
	if (a%2==0)
		return 0;
	else
	{
		for (i=3;i<=b;i=i+2)
		{
			if (a%i==0)
				return 0;
		}
		return 1;
	}
}
int main()
{
	int n;
	scanf("%d",&n);
	int i,j;
	int a;
	for (i=6;i<=n;i=i+2)
	{
		for (j=3;j<=i;j++)
		{
			if (sushu(j))
			{
			a=i-j;
			if (sushu(a))
			{
				printf("%d=%d+%d\n",i,j,a);
				break;
			}
			}
		}
	}
	return 0;
}


int sushu(int n)
{
 int i,s=1;
 for(i=2;i<=sqrt(n);i++)
  if(n%i==0)
  {
   s=0;
   break;
  }
 return(s);
}
main()
{
 int n,i,j;
 scanf("%d",&n);
 for(i=6;i<=n;i=i+2)
  for(j=3;j<=i/2;j++)
   if(sushu(j)&&sushu(i-j))
   {
	printf("%d=%d+%d\n",i,j,i-j);
	break;
   }
}


int main()
{
	int n;
	cin>>n;
	int i,j,k;
	for(i=4;i<=n;i+=2)
	{    int count=0;                                   //???N???????

		int c;
		c=i/2;

		for(j=3;j<=c&&count==0;j+=2)     //?  3?  i?????j
		{
			double genhao1,genhao2;
			genhao1=sqrt(j);
			int temp=0;

			for( k=3; k<=genhao1 ; k++ )
			{
				if(j%k==0)
					temp+=1;
			}
			if(temp==0)
			{
				int er,temp2=0;
				er=i-j;
				genhao2=sqrt(er);
				for(k=3;k<=genhao2;k++)
					if(er%k==0)
						temp2+=1;
				if(temp2==0)
				{
					cout<<i<<"="<<j<<"+"<<er<<endl;
					count+=1;
				}
			}
		}
	}
	return 0;
}


int isprime(int i);
int main(void)
{
	int i,j,k;
	int n;

	scanf("%d",&n);
	for(i=6;i<=n;i+=2)
	{
		for(j=2;j<=i/2;j++)
		{
			if(isprime(j)&&isprime(i-j))
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
	return 0;
}
int isprime(int i)
{
	int j;
	if(i%2==0)
	    return 0;
	for(j=3;j*j<=i;j+=2)
	{
		if(i%j==0)
		    return 0;
	}
	return 1;
}


int main ()
  {
    int n, a, b, m, sushu ;
    cin >> n ;
    if ( n % 2 == 1) n = n - 1 ;
    for (int i = 6 ; i <= n ; i = i + 2)
     {
       a = 3;
       b = i - a ;
       do
       {
       sushu = 1;
         for (int j = 3; j <= sqrt(a) ; j = j + 2)
          if (a % j == 0 ) sushu = 0 ;
         if (sushu == 1)
          {
            for (int k = 3; k <= sqrt (b) ; k = k + 2)
              if (b % k == 0) sushu = 0 ;
          }
        if (sushu == 1)  {cout << i << '=' << a << '+' << b << endl; break;}
           else  {a = a + 2 ; b = b - 2;}
       }while (sushu != 1);
     }
  return 0;
  }


int prime(int m)
{
	int i;
	for(i=2;i<=sqrt(m);i++)
		if(m%i==0)
		{
			return 0;
			break;
		}
	if(i>sqrt(m)) return 1;
}
void main()
{
	int i,n;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{
		int j,k;
		for(j=3;j<i;j++)
		{
			if(prime(j))
			{
				if(prime(i-j))
				{
					printf("%d=%d+%d\n",i,j,i-j);
					break;
				}
			}
		}

	}
}


int panduan(int x)
{
	int i,j;
	if(x>3)
		for(i=2;i<=sqrt(x);i++)
			if(x%i==0)
			{
				j=1;
				break;
			}
			else j=0;
	if(x<=3)
		j=0;
	if(j==0)
		return (x);
	else return 0;
}
int main()
{
	int n,a,b,i,j;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{
		printf("%d=",i);
		for(j=2;j<=n;j++)
		{
			int s,t;
			s=j;t=i-j;
			if((panduan(s)!=0)&&(panduan(t)!=0))
			{
				printf("%d+%d\n",s,t);
				break;
			}
		}
	}
	return 0;
}


int main()
{
	int m = 6, n, odd;
	int prime(int x);
	scanf("%d", &n);
    while(m <= n)
	{
		odd = 3;
		while(odd < m)
		{
			if(prime(odd) == 1)
			{
				if(prime(m - odd) == 1)
				{
					printf("%d=%d+%d\n", m, odd, m - odd);
					break;
				}
				else
					odd += 2;
			}
			else
				odd += 2;
		}
	    m += 2;
	}
    return 0;
}

int prime(int x)
{
	int i;
	for(i=3;i<=sqrt(x)+1;i+=2)
	{
		if(x%i == 0)
		{
			return 0;
		}

	}
    return 1;
}


void main(void)
{
	int n,i,j,k,t,p,q;
	scanf("%d",&n);
	for(p=6;p<=n;p=p+2)
	{
      for(i=3;j=p-i;i=i+2)
	  {
		k=sqrt(j);
		for(t=3;t<=k;t++)
			if(j%t==0)break;
		if(t>k)
		{
	    q=p-j;
  	    k=sqrt(q);
	    for(t=3;t<=k;t++)
			if(q%t==0) break;
		if(t>k) {printf("%d=%d+%d\n",p,i,j);break;}
		}
	  }
	}
}


int sushu(int n)
{
	int i,j;
	double h;

	if(n==2) return 1;
	h=sqrt(n)+1;
	j=(int)h;
	for(i=3;i<=j;i=i+2)
	{
		if(n%i==0)
		return 0;
	}
	return 1;
}
int main()
{
	int n,i;
	int m;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{
		for(m=3;m<=i/2;m=m+2)
		{	if(sushu(m)&&sushu(i-m))
			{
				printf("%d=%d+%d\n",i,m,i-m);
				break;
			}
		}
	}
	return 0;

}


int isprime(double n)
{
	long s,i;
	if(n<2)
	{
		return 0;
	}
	s=(double)sqrt(n);
	for(i=2;i<=s;++i)
	{
		if((int)n%i==0)
		{
			return 0;
		}
	}
	return 1;
}
void main()
{
	long i, j, n;
	scanf("%ld", &n);
	 for(i = 6; i <= n; i += 2)
	 {
        for(j = 2; j <= i / 2; ++j)
		{
			if(isprime(j) && isprime(i - j))
			{
				 printf("%ld=%ld+%ld\n", i, j, i - j);
				 break;
			}
		}
	 }
}


int main()
{
	int n,i,j,t,k,p=1,u=1,c,x,y;
    scanf("%d",&n);
	for(i=6;i<=n;i+=2)
	{
	   for(j=3;j<=i/2;j++)
	   {
		   c=sqrt(j);
		   	   if(j%2==0)
			   {
				   goto loop;
			   }
		   for(k=3;k<=c;k++)
		   {
			   if(j%k==0)
				   goto loop;
		   }
			   x=i-j;
			   y=sqrt(x);
			      for(t=3;t<=y;t+=2)
				  {
				     if(x%2==0)
					 {
                        goto loop;
					 }
				     else if(x%t==0)
                        goto loop;

				  }
					   printf("%d=%d+%d\n",i,j,x);
					   goto er;
		   loop:;
	   }
er:;
	}
	return 0;
}


int sushu(int n)
{
int i,s,t;
i=2;
if (n==3)
t=1;
else
{
while (i<=sqrt(n))
	{
	s=n%i;
	if (s!=0)
	{
		if(i==2)
			i=i+1;
		else
			i=i+2;
	}
	else
		break;
	}
if (i>sqrt(n))
	t=1;
else
    t=0;
}
return (t);
}

void main()
{
int a,b,c,d,e,f,j;
scanf("%d",&f);
for(a=6;a<=f;a=a+2)
{

for(j=3;j<=a/2;j=j+2)
{
	b=sushu(j);
	c=sushu(a-j);
	if(b==1&&c==1)
	{
		d=j;
		e=a-j;
		break;
	}
}
printf("%d=%d+%d\n",a,d,e);

}
}


int susu(int a)
{
	if(a%2==0)
		return 0;
	int i,k=1;
	for(i=3;i<=sqrt(a);i=i+2)
		if(a%i==0)
			k=0;
		return k;
}
int main()
{
	int n,m,l,z,x;
	cin>>n;
	for(z=6;z<=n;z=z+2)
		for(l=3;l<=(z/2);l=l+2)
		{
			if(susu(l)+susu(z-l)==2)
			{cout<<z<<"="<<l<<"+"<<(z-l)<<endl;break;}
			else continue;
		}
		return 0;
}


int prime(int x);
int main()
{
	int n;
	scanf("%d",&n);
	int a;
	for(a=6;a<=n;a=a+2)
	{
		int p,q,sp,sq;
	    for(p=3,sp=0,sq=0;p<=a/2;p=p+2)
		{
		    q=a-p;
			sp=prime(p);
			sq=prime(q);
			if(sp*sq==1)
			{
				printf("%d=%d+%d\n",a,p,q);
			    break;
			}

		}

	}
	return 0;
}

int prime(int x)
{
	int j,sx=0;
	if(x==3||x==5||x==7)
		sx=1;
	for(j=3;j*j<x;j=j+2)
	{
	    if(x%j==0)break;
	    if((j+2)*(j+2)>x)
		{
		  sx=1;
		}
	}
	return sx;
}


int main(int argc, char* argv[])
{
	int n;
    int t;
	int i,j,k,count;
	int a,b;
	int tag=0;
	scanf("%d",&n);

	for(t=6;t<=n;t=t+2)
	{    tag=0;

		for(j=2;;j=j+1)
		{
			if(tag!=1)
			{

			a=sqrt(j)+2;

			for(k=2;k<a;k++)

			{

			count=k+1;
			if((j%k!=0&&j!=2)||j==2)
			{
				if(count>=a)
				{
					b=sqrt(t-j)+2;

                      for(i=2;i<b;i++)
					  {
		                 if((t-j)%i==0)
	                        break;
						 else
						 {
							 if((i+1)>=b)
							 {
								 tag=1;
							 }
						 }

					  }

				}
			}

			else  break;

			}

		}
			else
				break;
		}

		printf("%d=%d+%d\n",t,j-1,t-j+1);
	}

	return 0;
}


int primenumber(int n)
{
  int l,k;
  k=(int)sqrt(n);
  for(l=3;l<=k;l++)
  {
	  if(n%l==0)
	  {
       return 0;
	  }

  }
  return 1;
}
int main()
{
	int m,k,b,i;
    scanf("%d",&m);
	k=(int)sqrt(m);
	for(i=6;i<=m;i=i+2)
	{
	    for(b=3;b<=i/2;	b=b+2)
		{
			if(primenumber(b)&&primenumber(i-b))
			{
				break;
			}
		}
		printf("%d=%d+%d\n",i,b,i-b);
	}

	return 0;
}


int prime(int x)
{
	int prime=1,i;
	for(i=2;i<=sqrt(x);i++)
	{
		if(x%i==0)
		{
			prime=0;
			break;
		}
	}
	return prime;
}

int main()
{
	int n;
	scanf("%d",&n);
	int i,j;
	for(i=6;i<=n;i=i+2)
	{
		for(j=3;j<=i/2;j=j+2)
		{
			if(prime(j)==1&&prime(i-j)==1)
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
	return 0;
}


main()
{
	int n,i,k,m,p,q;
	scanf("%ld",&n);
	for(i=6;i<=n;i=i+2)
	{
		for(k=3;k<=i/2;k=k+2)
		{
			m=i-k;
			for(p=3;p<=sqrt(k);p=p+2)
				if(k%p==0) break;
			for(q=3;q<=sqrt(m);q=q+2)
				if(m%q==0) break;
			if(p>=(((int)sqrt(k))+1)&&q>=(((int)sqrt(m))+1))
			{
				printf("%ld=%ld+%ld\n",i,k,m);
				break;
			}
			else continue;
		}
	}
}


int sushu(int k)
{
	int i;
	double m;
	if(k>10)
		m =sqrt(k);
	else
		m=k-1;
	if(k%2==0)
		return 0;
	for(i=3;i<=m;i+=2)
	{
		if((k%i)==0)
			break;
	}
	if(i<=m)
		return 0;
	else
		return 1;
}

int main()
{
	int n,x,j,k;
	scanf("%d",&n);
	for(k=6;k<=n;k+=2)
	{
		for(x=3;x<=k;x++)
		{
			j=k-x;
			if(sushu(x)&&sushu(j))
			{
				printf("%d=%d+%d\n",k,x,j);
				break;
			}
		}
	}

	return 0;
}


int ss(int n)
{
	int i,s;
	s=0;
	i=2;
	if(n==2||n==3) return 1;

	do
	{
		i++;
	if(n%i==0) s++;
	}
	while(i*i<n);
	if(s==0) return 1;
	else return 0;}

int main()
{
	int m,k,j,p;
	scanf("%d",&m);
	for(k=6;k<=m;k=k+2)
	{
		for(j=3;j<=k/2;j+=2)
		{
			if(ss(j))
			{
				p=k-j;
				if(ss(p))
				{
					printf("%d=%d+%d\n",k,j,p);
					break;
				}
			}
		}
	}
return 0;
}


int n,i,j,k,limit,s;
int main(){
	scanf("%d",&n);
	for (i=2;i<=n;i+=2)
		for (j=3;j<=i/2;j+=2){
			int flag=1;
			limit=sqrt(j);
			for (k=3;k<=limit;k+=2)
				if (j%k==0){
					flag=0;break;
				}
			if (!flag)continue;
			limit=sqrt(i-j);
			for (k=3;k<=limit;k+=2)
				if ((i-j)%k==0){
					flag=0;break;
				}
			if (flag){
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	return 0;
}


int prime(int);
int main()
{
	int n,i,j;
	cin>>n;
	for(i=6;i<=n;i=i+2)
	{
		for(j=3;j<=i/2;j=j+2)
			if(prime(j)&&prime(i-j))
			{
				cout<<i<<'='<<j<<'+'<<i-j<<endl;
				break;
			}
	}
	return 0;
}
int prime(int k)
{
	int i;
	if(k==3||k==5||k==7)return 1;
	else
	{
		for(i=3;i<=sqrt(k);i=i+2)
			if(k%i==0)
				return 0;
		return 1;
	}
}


void main()
{ int su(int k);
  int n,i,j,p,q;
  scanf("%d",&n);
  for(i=6;i<=n;i+=2)
  {
  	for(j=3;j<=i/2;j+=2)
  	{
  		p=su(j);
  		q=su(i-j);
  		if(p&&q) {printf("%d=%d+%d\n",i,j,i-j);break;}

  		}

  	}
}
int su(int k)
{
	int m,t=1;
	for(m=2;m<=sqrt(k);m++)
	{
		if(k%m==0) {t=0;break;}

	}
	return (t);
	}


int su(int m);
void main()
{
	long n, p, i;
	scanf("%ld", &n);
	for(i=6; i<=n; i=i+2)
	{
		for(p=2;p<i;p++)
			if(su(p)&&su(i-p)&&p<=i-p) break;
		printf("%ld=%ld+%ld\n", i, p, i-p);
	}
}
int su(int m)
{
	int j, k;
	k=sqrt(m);
	for(j=2;j<=k;j++)
		if(m%j==0)
			return(0);
		return(m);
}


int prove(int x)
{
int y=1,i;
if(x%2==0) y=0;
else
for(i=3;i<=sqrt(x);i++)
	{if(x%i==0) y=0;
	}
return(y);
}
void gede(unsigned int i,unsigned int j)
{	 unsigned int x,y,k,l;
	for(k=3;k<=i/2;k=k+2)
		{
		l=i-k;
		int prove(int x);
		x=prove(k);
		y=prove(l);
		if(x==1&&y==1)
			{
			printf("%d=%d+%d\n",i,k,l);
			break;
			}
		}
if(i<j-1) gede(i+2,j);
}
int main()
{
unsigned int n;
scanf("%d",&n);
gede(6,n);
return(0);
}


int main (int argc, char *argv[])
{
  int n,m,i,j,t,l,x,y;
  int a,b;
  scanf("%d",&m);
  y=m/2;
  for(x=3;x<=y;x++)
  {
    n=2*x;
    for(i=n;x<=i;i--)
     {
      if(i%2!=0)
      {
       a=ceil((double)sqrt(i));
       for(j=2;j<=a;j++)
       {
        if(i%j==0)
        {
           break;
        }
        else
        {
            if(j==ceil(a))
            {
                  t=n-i;
                  b=ceil((double)sqrt(t));
                  for(l=2;l<=b;l++)
                  {
                     if(t%l==0)
                     {
                        break;
                     }
                     else
                     {
                       if(l==ceil(b))
                       {
                         printf("%d=%d+%d\n",n,t,i);
                         goto finish;
                       }
                     }
                  }
            }
        }
       }
      }
     }finish: x;
  }
  return 0;
}


int prime(int n)
{
	int j;
	for(j=2;j<=sqrt(n);j++)
		if(n%j==0) break;
		if(j>sqrt(n)) return 1;
		else return 0;
}

int print(int n,int i)
{
	printf("%d=%d+%d\n",n,i,n-i);
	return 0;
}

int main()
{
	int k,i,m,n;
	scanf("%d",&n);
	for(k=6;k<=n;k=k+2)
	{
	if(prime(k-2)==1)
		print(k,2);
	else
	{
		for(i=3;i<=k/2;i=i+2)
			if(prime(i)==1&&prime(k-i)==1)
			{
				print(k,i);
				break;
			}
	}
	}
	return 0;
}


void main()
{
	int sushu(int a);
	int n,i,m,j,k;
	scanf("%d",&n);
	for (k=6;k<=n;k++,k++)
	{   for (j=3;j<=k/2;j++,j++)
	{       if (sushu(j)==1)
			   m=k-j;
	        if (sushu(m)==1)
			{	printf("%d=%d+%d\n",k,j,m);
			break;}
	}
	}
}
    int sushu(int a)
	{   int i;
	    for (i=3;i<=sqrt(a);i++,i++)
			if (a%i==0)
				break;
		if (i>sqrt(a))
			return (1);
		else
			return(0);
	}


void main()
{
	long n,a,b,i,k,m;
	scanf("%ld",&n);
	for(i=6;i<=n;i=i+2)
	{
		  for(a=3;a<=(long)(i/2);a++)

		  {
			  b=i-a;
			  for(k=2;k<=sqrt(a);k++)
			  {
				if(a%k==0)break;
			  }
			  for(m=2;m<=sqrt(b);m++)
			  {
				if(b%m==0)break;
			  }
			  if(k>sqrt(a)&&m>sqrt(b))
			  {
				printf("%ld=%ld+%ld\n",i,a,b);
				break;
			  }
		  }

	}
}


int isprime(int x);
int main()
{
	int n,a;
	scanf("%d",&n);
	a=6;
	while(a<=n)
	{
		int b;
		for(b=3;b<=a/2;b+=2)
		{if(isprime(b)&&isprime(a-b))
		{printf("%d=%d+%d\n",a,b,a-b);break;}}
		a+=2;
	}
}
int isprime(int x)
{
	int y,s;
	s=sqrt(x);
	for(y=3;y<=s;y++)
		if(x%y==0) return 0;
		if(y>=s+1) return 1;
}


int prime(int x);

int main()
{
	int a,j,i;
	scanf("%d",&a);
	for(i=6;i<=a;i=i+2)
	{
		for(j=3;j<=(a/2);j=j+2)
		{
		    if(prime(j)+prime(i-j)==2)
			{
			     printf("%d=%d+%d\n",i,j,i-j);
			     break;
			}
		}
	}
	return 0;
}

int prime(int x)
{
	int i;
	int isprime=1;
	if(x==3||x==5||x==7)
	{
		return isprime;
	}
	else
	{
		for(i=3;i<=sqrt(x);i=i+2)
		{
			if(x%i==0)
			{
				isprime=0;
				return isprime;
				break;
			}
		}
	}
	return isprime;
}


int sushu(long a)
{
	long i,temp;
	if(a==2||a==3)
		return 1;
	if(a%2==0)
		return 0;
	temp=(int)sqrt(a);
	for(i=3;i<=temp;i+=2)
		if(a%i==0)
			break;
	if(i>temp)
		return 1;
	return 0;
}
void main()
{
	long n,i,j;
	scanf("%ld",&n);
	for(j=6;j<=n;j+=2)
	{printf("%d=",j);
	for(i=2;i<=j/2;i++)
		if(sushu(i)&&sushu(j-i))
		{printf("%d+%d\n",i,j-i);break;}
	}
}


int sushu(int x){
	int b,i=0;
	for(b=2;b<=sqrt(x);b++){
		if(x%b==0){
			i++;
			break;
		}
		else continue;
	}
	if(i==0)
    return 0;
	else return x;
}
int main(int argc, char* argv[])
{
int n,x,b,c;
scanf("%d\n",&n);
for(x=6;x<=n;x+=2){
	for(b=2;b<=x/2;b++){
			c=x-b;
		    if(sushu(b)==0&&sushu(c)==0){
				printf("%d=%d+%d\n",x,b,c);
				break;
			}
			else continue;
	}
}

	return 0;
}


void main()
{
	long a,k,i;
    int f(long x);
	scanf("%ld",&a);
	for (i=6;i<=a;i=i+2)
		for(k=3;k<=i/2;k=k+2)
		{
			if(f(k)==0&&f(i-k)==0)
			{
				printf("%ld=%ld+%ld\n",i,k,i-k);
				break;
			}
		}
}
int f(long x)
{
	int j,sum;
	sum=0;
	for(j=3;j<=floor(sqrt(x));j=j+2)
		if (x%j==0) {sum=1;break;}
	return(sum);
}


void main()
{
	unsigned i,n;
	int checkN(unsigned);
	scanf("%u",&n);
	for(i=6; i<=n; i+=2)
	{
		unsigned j=0,k=0;
		for(j=3; j<=i-3;j++)
		{
			if(checkN(j)==1 && checkN(i-j)==1)
			{
				printf("%u=%u+%u\n",i,j,i-j);
				break;
			}
		}
	}
}
int checkN(unsigned n)
{
	if(n%2==0)
		return 0;
	else
	{
		unsigned i;
		for(i=3; i<=sqrt(n); i+=2)
		{
			if(n%i==0)
			{
				return 0;
				break;
			}
		}
		if(i>sqrt(n))
			return 1;
	}
}


void main()
{
	long int n,i,j,k,l,t,s,a,b;
	scanf("%ld",&n);printf("\n");
	for(i=6;i<=n;i=i+2)
	{

		for(k=3;k<=i;k=k+2)
		{
			for(j=3;j<=sqrt(k);j++)
			{
				if(k%j==0)break;
			}
			if(j>sqrt(k))
			{b=i-k;
			for(l=2;l<=sqrt(b);l++)
			{

				if(b%l==0)break;
			}
			if(l>sqrt(b))
			{printf("%ld=%ld+%ld\n",i,k,b);break;}}
		}
	}
}


int IsPrime(int m)
{
	int k,i;
	k=sqrt(m);
	if(m==2) return 1;
	if(m%2!=0)
	{
		for(i=3;i<=k;i=i+2)
		   if(m%i==0)
			 break;
	    if(i==k+2||i==k+1)
		     return 1;
	    else return 0;
	}
}

void f(int n)
{
	int p,q,i;
	if(p==2&&IsPrime(n-2)==1)
		printf("%d=2+%d\n",n,n-2);
	for(i=3;i<=n/2;i++)
	{
		p=i;
		q=n-p;
		if(IsPrime(p)==1&&IsPrime(q)==1){
			printf("%d=%d+%d\n",n,p,q);
			break;
		}
	}
}

void main()
{
	int n,i;
	scanf("%d",&n);
	i=6;
	while(i<=n)
	{
		f(i);
		i=i+2;
	};
}


main()
{
      int i,j,k,m,n;
      int su(int a);
      scanf("%d",&n);
      for(i=6;i<=n;i=i+2)
      {
                         for(j=3;j<=n;j=j+2)
                         {
                                            if(su(j)&&su(i-j))
                                            {printf("%d=%d+%d\n",i,j,i-j);
                                            break;}
                         }
                         }

      }
int su(int a)
{
    int i,k;
    k=sqrt(a);
    for(i=3;i<=k;i=i+2)
    if(a%i==0)
    return 0;
    return 1;
    }


int check(int k)
{
	int x;
	if((k%2==0)&&(k!=2))
		return 0;
	for(x=3;x<=sqrt(k);)
	{
		if(k%x==0)
			break;
		x+=2;
	}
	if(x>sqrt(k))
		return 1;
	else
		return 0;
}
void main()
{
	int n,i,j,m;
	scanf("%d",&n);
	for(i=6;i<=n;)
	{
		for(j=2;;j++)
		{
			if(check(j))
			{
				m=i-j;
				if(check(m))
				{
					printf("%d=%d+%d\n",i,j,m);
					break;
				}
			}
		}
		i+=2;
	}
}


main()
{int sushu(int i);
 int n,e,i,j,k,p,q,d;
 scanf("%d",&n);
 for(p=6;p<=n;p=p+2)
 {for(e=2;e<p;e++)
    {if((sushu(e)==1)&&(sushu(p-e)==1))
     {printf("%d=%d+%d",p,e,p-e);break;}
    }
  printf("\n");
 }

}

int sushu(int i)
{int j,p,s;
 s=sqrt(i);
 for(j=2,p=1;j<=s;j++)
    if(i%j==0) {p=0;break;}
 return (p);
    }


int fflag(int n);
int main()
{
int i,n;
int t;
scanf("%d",&t);
for(i=6;i<=t;i+=2)
{
for(n=2;n<i;n++)
if(fflag(n))
if(fflag(i-n))
{
printf("%d=%d+%d\n",i,n,i-n);
break;
}
if(n==i) printf("error %d\n",i);
}
}

int fflag(int i)
{
int j;
if(i<=1)return 0;
if(i==2)return 1;
if(!(i%2))return 0;
for(j=3;j<=(int)(sqrt((double)i)+1);j+=2)
if(!(i%j))return 0;
return 1;
}


int main()
{
	int i,j,p,q,N;
	double k,t;
	scanf("%d",&N);
	for(i=6;i<=N;i=i+2)
	{
		for(j=3;j<i;j++)
		{
			k=sqrt((double)j);
			for(p=2;p<=k;p++)
				if(j%p==0)
					break;
			if(p>k) {

				t=sqrt((double)(i-j));
				for(q=2;q<=t;q++)
					if((i-j)%q==0)
						break;
				if(q>t)
					break;
				else
					continue;
			}else
				continue;

		}
		printf("%d=%d+%d\n",i,j,(i-j));

	}
	return 0;
}


int prime(int n)
{
	int i;
	if(n%2==0) return 0;
	for(i=3;i<=sqrt(n);i+=2)
		if(n%i==0)
			return 0;
	return 1;
}
void print(int n)
{
	int i;
	for(i=2;i<n-1;i++)
		if(prime(i)&&prime(n-i)){
			printf("%d=%d+%d\n",n,i,n-i);
			break;
		}
}

int main()
{
	int n,i;
	scanf("%d",&n);
	for(i=6;i<=n;i+=2)
		print(i);
	return 0;
}


int su(int z)
  {
       int i=2,t=0,k=sqrt(z);
       for(i=2;i<=k;i++)
        {
          if(z%i==0)
          break;
        }
        if(i>k)  t=1;
        return t;
}
int main()
{
    int n,m,i,j;
    scanf("%d",&m);
    for(n=6;n<=m;n+=2)
      {
          for(i=3;i<=n/2;i+=2)
           {  j=n-i;
             if(su(i)&&su(j))
             {printf("%d=%d+%d\n",n,i,j);
             break;}
          }
      }
      getchar();
      getchar();
      return 0;
}


int main()
{
	int n , i , ii , j ,jj , q , k , kk;
	cin >> n;
	for(i = 6;i <= n; i += 2)
	{
		ii = i / 2;
		for(j = 3;j <= ii;j++)
		{
			jj = sqrt((float)j);
			for (q = 2;q <= (int)jj;q++)
				if (j % q == 0) break;
			if (q == (jj+1))
			{
				k = i - j;
				kk = sqrt((float)k);
				for (q = 2;q <= (int)kk;q++)
					if (k % q == 0) break;
				if (q == (kk+1))
				{
					cout << i << "=" << j << "+" << k << endl;
					break;
				}
			}
		}
	}

	return 0;

}


long int check(long int n)
{
	if(n==1)return 0;
	if(n==2)return 1;
	int j;
	for(j=2;j<=(int)sqrt(n);j++)if(n%j==0)return 0;
	return 1;
}
int main()
{
	long int n,i;
    scanf("%ld",&n);
	for(i=6;i<=n;i=i+2)
	{
		int j;
		for(j=3;j<i;j=j+2)
		{
			if(check(j)&&check(i-j))
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
	return 0;
}


int sushu(int a)
{   int i,gha;
    if (a%2==0)
	{
		return 0;
	}
    gha=(int)sqrt(a);
	for (i=3;i<=gha;i+=2)
	{
		if (a%i==0)  return 0;
	}
	return 1;
}

int main()
{
	int n,i,j;
    scanf("%d",&n);
	for (i=6;i<=n;i+=2)
	{
		for (j=2;j<=i/2;j++)
		{
			if (sushu(j) && sushu(i-j))
			{   printf("%d=%d+%d\n",i,j,i-j);
			    break;
			}
		}
	}

	return 0;
}


int main()
{
	long n;
	scanf("%ld",&n);
	long su[25000];
	long i,j,num=0;
	for(i=2;i<25001;i++)
	{
		for(j=2;j<=sqrt(i);j++)
		{
			if(i%j==0)
				break;
		}
		if(j>sqrt(i))
		{
			su[num]=i;
			num++;
		}
	}
	long a,b;
	for(a=6;a<=n;a+=2)
	{
		for(i=0;;i++)
		{
			b=a-su[i];
			for(j=2;j<=sqrt(b);j++)
			{
				if(b%j==0)
					break;
			}
			if(j>sqrt(b))
				printf("%ld=%ld+%ld\n",a,su[i],b);
			if(j>sqrt(b))
				break;
		}
	}
	return 0;
}


int sushu(int a)
{
int i,m;
if(a==2||a==3)
	{
	return(1);
	}
else
{
m=sqrt(a);
for(i=2;i<=m;i++)
	{
	if(a%i==0)
	break;
	}
	if(i>m)
	return(1);
	else
	return(0);
}
}
void main()
{
	int n,j,k,d,e;
	scanf("%d",&n);
	for(j=6;j<=n;j=j+2)
	{
	for(k=2;k<j;k++)
		{
		d=sushu(k);
		e=sushu(j-k);
		if(d==1&&e==1)
			{
			printf("%d=%d+%d\n",j,k,(j-k));
			break;
			}
		}
	}
}


int prime(int n)
{
	int m;
	for(m=2;m<=sqrt(n);m++)
		if(n%m==0) return 0;
		return 1;
}
int main()
{
	int n,i,temp1;
	cin>>n;
	for(i=6;i<=n;i++)
	{
		if(i%2==0)
		{
			for(temp1=2;temp1<i;temp1++)
				if(prime(temp1))
				{
					if(prime(i-temp1))
					{
						cout<<i<<"="<<temp1<<"+"<<i-temp1<<endl;
						break;
					}
				}
		}
	}
	return 0;
}


int isprime(long n)
{   long i;int j;j=1;
    if(n!=2)
    for(i=2;i<=sqrt(n);i++){{if(n%i==0){j=0;break;}}}
    return j;
}
int main()
{
    int n,i,j;
    scanf("%d",&n);
    for(j=3;j<=n/2;j++)
    {for(i=3;i<=2*j-1;i++)
    {
    if(isprime(i)&&isprime(2*j-i)){printf("%d=%d+%d\n",2*j,i,2*j-i);break;}
    }}

}


int main()
{
	int n,i,p,q,j,m;
	scanf("%ld",&n);
	for(i=6;i<=n;i=i+2)
	{
		for(p=3;p<=(i/2);p=p+2)
		{
			q=i-p;
			for(j=3;j<sqrt(p);j++)
			{
				if(p%j==0) break;
			}
			for(m=3;m<sqrt(q);m++)
			{
				if(q%m==0) break;
			}
			if(j>=((int)sqrt(p)+1)&&m>=((int)sqrt(q)+1))
			{
				printf("%ld=%ld+%ld\n",i,p,q);
				break;
			}
			else continue;
		}
	}
return 0;
}


int main(int argc, char* argv[])
{
	int i,p;
	int x,n;
	int f,g;
	int primep,primeq;
	scanf("%d",&x);

	for(n=6;n<=x;n++)
	{
		if(n%2==0)
		{
		  for(p=2;p<n;p++)
		  {
			primep=1;
			f=sqrt(p);
			for(i=2;i<=f;i++)
			{if(p%i==0){primep=0;break;}}
			if(primep!=0)
			{
				primeq=1;
				g=sqrt(n-p);
				for(i=2;i<=g;i++)
				{if((n-p)%i==0){primeq=0;break;}}
				if(primeq!=0&&(n-p)>1&&p<=(n-p)){printf("%d=%d+%d\n",n,p,n-p);break;}

			}
		  }
		}
	}
	return 0;
}


int prime(int x);
void main()
{
	int n,i,j;
	scanf("%d",&n);
	for(i=6;i<=n;i+=2)
	{
		for(j=3;j<i;j+=2)
		{
			if(prime(j)&&prime(i-j))
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
}
int prime(int x)
{
	int k;
	for(k=3;k<=sqrt(x);k++)
	{
		if(x%k==0)
			break;
	}
	if(k>sqrt(x))
		return 1;
	else
		return 0;
}


int su(int k);

int main()
{
	int n;
	scanf("%d",&n);
	int f = 6;
	int k;
	while(f<=n)
	{
		int i = 2;
		while(i<=(f/2))
		{
			if ( su(i) == 1 )
			{
				k = f - i;
				if ( su (k) == 1)
				{
					printf("%d=%d+%d\n",f,i,k);
					break;
				}
			}
			i++;
		}
		f += 2;
	}
	return 0;
}

int su(int k)
{
	int i;
	for(i = 2; i <= sqrt(k);i++)
	{
		if( k%i == 0 )
		{
			return 0;
		}
	}
	return 1;
}


int main()
{
	int n,i,k,j,m,a;
	scanf("%d",&n);
	for(i=6;i<=n;i+=2)
	{
		for(j=3;j<i;j++)
		{
		   for(k=2;k<=sqrt(j);k++)
		   {
		       if(j%k==0)
			   break;
		   }
		       if(k>sqrt(j))
			   {
		        	m=i-j;
			   }
		 	for(a=2;a<=sqrt(m);a++)
			{
	        	if(m%a==0)
			    break;
			}
		       if(a>sqrt(m))
			   {
		      	printf("%d=%d+%d\n",i,j,m);
				break;
			   }
		}
	}
	return 0;
}


int main()
{
	int shisushu(int j);
	int n,i,j,p,k;
	scanf("%d",&n);
	for(i=6;i<=n;i+=2)
	{
		for(j=2;j<=(i/2);j++)
		{
			if(shisushu(j)&&shisushu(i-j))
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
	return 0;
}
int shisushu(int j)
{
	int k,p;
	if(j==2||j==3||j==5||j==7||j==11||j==13||j==17)return 1;
	else{
	k=sqrt(j);
	for(p=2;p<=k;p++)
		if(j%p==0)break;
		if(p>k)return 1;}
	return 0;
}


int prime(int n)
{
	int i=0, t=0;
	float f=0;
	f=sqrt(n);
	t=(int)f;
	if(n<=10)
	{
		if((n==2)||(n==3)||(n==5)||(n==7)) return(1);
		else return(0);
	}
	else
	{
		if(n%2==0) return(0);
		else
		{	for(i=3;i<=t;i++)
			{
				if(n%i==0) break;
			}
			if(i==t+1) return(1);
			else return(0);
		}
	}
}
void divide(int a)
{
	int i;
	for(i=2;i<=a;i++)
	{
		if((prime(i)==1)&&(prime(a-i)==1))
			break;
	}
	printf("%d=%d+%d\n", a, i, a-i);
}
int main()
{
	int m, n;
	int i, j;
	scanf("%d", &m);
	if(m>=6)
	{
		for(i=6;i<=m;i=i+2)
			divide(i);
	}
}


int sushu(int x)
{
	int j,z=0;
	if(x%2==0)
		z=1;
	else
	{
		for(j=3;j<=sqrt(x);j+=2)
		{
			if(x%j==0)
			{
				z=1;
				break;
			}
		}
	}
	return(z);
}
main()
{
	int max,i,j,a,b;
	scanf("%d",&max);
	for(i=6;i<=max;i+=2)
	{
		for(j=2;j<=i/2;j++)
		{
			a=sushu(j);
			b=sushu(i-j);
			if(a==0&&b==0)
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
	return 0;
}


int isprime(int p)
{
	int i;
	if(p%2==0)
	{
		if(p==2)
		{
			return 1;
		}
		return 0;
	}
	for(i=3;i<=sqrt(p);i=i+2)
	{
		if(p%i==0)
		{
			return 0;
		}
	}
	return 1;
}

int main()
{
	int isprime1,isprime2;
	int n,i,j;
	scanf("%d",&n);
	for(j=6;j<=n;j=j+2)
	{
		for(i=3;i<=j/2;i=i+2)
		{
			isprime1 = isprime(i);
			isprime2 = isprime(j-i);
			if(isprime1==1 && isprime2==1)
			{
               printf("%d=%d+%d\n",j,i,j-i);
			    break;
			}

		}
	}
	return 0;
}


int panduan(long int n)
{
	long int i;
	if(n==1) return 0;
	else
	{
		for(i=2;i<=sqrt(n);i++)
			if(n%i==0) break;
		if(i<=sqrt(n)) return 0;
		else return 1;
	}
}
void main()
{
	long int n,x,i;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{
		for(x=3;x<=n/2;x=x+2)
		{
			if(panduan(x))
				if(panduan(i-x))
				{printf("%d=%d+%d\n",i,x,i-x);break;}
		}

	}
}


int sushu(int a)
{
    int x=(int) sqrt(a);
    int i;
    int k=1;
    for (i=2;i<=x;i++)
    {
        if (a%i!=0) k=1;
        else
        {
            k=0;
            break;
        }
    }
    return k;
}
main()
{
      int n;
      scanf ("%d",&n);
      int i,j,k;
      for (i=6;i<=n;i=i+2)
      {
          for (j=3;j<=i-j;j=j+2)
          {
              if (sushu(j)==1&&sushu(i-j)==1)
              { printf ("%d=%d+%d\n",i,j,i-j); break; }
          }
      }
}


void main()
{
  long prime(long x);
  long n,i,j;
  scanf("%d",&n);
  for(i=6;i<=n;i=i+2)
    for(j=3;j<=i/2;j=j+2)
     {
       if(prime(j)==1&&prime(i-j)==1)
       {printf("%ld=%ld+%ld\n",i,j,i-j);
        break;}
     }
}

long prime(long x)
{
    int flag;
    long i;
    if(x==2)
      flag=1;
    if(x%2==0&&x!=2)
      flag=0;
    if(x%2!=0)
   {
        flag=1;
        for(i=3;i<=sqrt(x);i=i+2)
        {
        if(x%i==0)
          {
           flag=0;
           break;
          }
        }
   }
   return(flag);
}


int judge(int a)
{
	int temp;
	if(a%2!=0)
	{
		temp=0;
		int i;
		for(i=3;i<=sqrt(a);i++)
			if(a%i==0)
				temp++;
	}
	if(temp==0)return 1;
	else return 0;
}
void main()
{
	int n,m,i;
	scanf("%d",&n);
		for(m=6;m<=n;m++)
		{
			if(m%2==0)
			{
				for(i=3;i<m;i++)
					if(judge(i)==1)
					{
						int j;
						j=m-i;
						if(judge(j)==1)
						{
							printf("%d=%d+%d",m,i,j);
						    break;
						}else continue;
					}
			    printf("\n");
			}

		}
}


char stack[MAX];
int count=0;

int isprime(int n)
{
	return stack[n];
}

void makechart(int n)
{
	int i,j;
memset(stack,1,sizeof(char)*(n+1));
stack[1]=0;
	for (i=2;i<n;i++)
	{        if(stack[i]==0) continue;

		for (j=2;j*i<=n;j++)
		{
	    	stack[i*j]=0;
		}
	}
}

int main()
{
	int n;
	int i,j;
	scanf("%d",&n);
	makechart(n);
	for (i=6;i<=n;i+=2)
	{
		for (j=2;j+j<=i;j++)
		{
			if (isprime(j)&&isprime(i-j))
			{
				printf("%d=%d+%d\n",i,j,i-j);
			break;
			}
		}
	}
	return 0;
}


void main()
{
	int N,n,m,i,j,flag;
	scanf("%d",&N);
	for(n=6;n<=N;n+=2)
	{
		for(m=3;m<n;m+=2)
			{
			flag=1;
			for(i=2;i<=sqrt(m);i++)
				if(m%i==0){flag=0;break;}
			if(flag==1)
				{
				m=n-m;
				for(i=2;i<=sqrt(m);i++)
					if(m%i==0){flag=0;break;}
				}
			else continue;
			if(flag==1){printf("%d=%d+%d\n",n,n-m,m);break;}
			m=n-m;
			}
	}
}


int sushu(int n)
{int i=2;
for(i=2;i<=sqrt(n);i++)
if(n%i==0) break;
if(i>sqrt(n)) return 1;
else return 0;
}
void main()
{
long int m;
scanf("%d",&m);
int j=6,i=2;
for(j=6;j<=m;j=j+2)
{
	for(i=2;i<=j/2;i++)
	{
		if(sushu(i)==1&&sushu(j-i)==1)
	break;
	}
	printf("%d=%d+%d",j,i,j-i);
	printf("\n");

}

}


void main()
{
	int ss(long a);
	long n,j;
int i;
scanf("%d",&n);
for(i=6;i<=n;i+=2)
{
for (j=3;ss(j)!=1||ss(i-j)!=1;j+=2);
printf("%d=%d+%d\n",i,j,i-j);

}
}
int ss(long a)
{
int k,c=1;
for(k=3;k<=sqrt(a);k+=2)
{
	if(a%k==0){c=0;break;};

}
return (c);
}


int f(int s)
{
	int t;
	for(t=3;t<=(int)sqrt(s);t=t+2)
		if(s%t==0)
			break;
	if(t>(int)sqrt(s))
		return 1;
	else
		return 0;
}

void main()
{
	int m,k,h,i,d,r=0;
	scanf("%d",&d);
	for(m=6;m<=d;m=m+2)
	{
	   for(i=3;i<(m/2+1);i=i+2)
	   {
	    	k=i;
	    	h=m-i;
	    	r=0;
		    if(f(k) && f(h))
			{
			   printf("%d=%d+%d\n",m,k,h);
			   break;
			}
	   }
	}
}


int isprime(int p)
{
	int prime=1;
	int i;
	if(p==2)
	{
	 return prime;
	}
	for(i=3;i<=(p/2);i=i+2)
	{
		if(p%i==0)
		{
			prime=0;
		break;
		}
	}
	return prime;
}
int main()
{
	int n;
	int i,j;
	scanf("%d",&n);
	if(n>50000)
	{
		printf("??????50000??\n");
	}
	else
	{
			for(i=6;i<=n;i=i+2)
		{

			for(j=3;j<=i;j=j+2)

			{

				if(isprime(j)==1)
				{

					int m;
					m=i-j;
					if(isprime(m)==1)
					{
						printf("%d=%d+%d\n",i,j,m);
						break;
					}
				}
			}

		}
	}
		return 0;
}


int issushu(int x)
{
double y;
int i,flag;
flag=1;
y=sqrt((double)x);
for(i=3;i<=y;i+=2)
if(x%i==0)flag=0;
return flag;
}
int main()
{
int n,i,j;
scanf("%d",&n);
for(i=6;i<=n;i+=2)
for(j=3;j<=i/2;j+=2)
if(issushu(j) && issushu(i-j))
{
printf("%d=%d+%d\n",i,j,i-j);
break;
}
return 0;
}


int f(int a)
{int i,b;
b=sqrt(a);
if(a%2==0)
return 0;
for (i=3;i<=sqrt(a);i+=2)
{if(a%i==0)
return 0;}
return 1;
}
int main()
{int n,j,k;
scanf("%d",&n);
for(j=6;j<=n;j+=2)
{
	for(k=3;k<=j;k++)
if(f(k)==1&&f(j-k)==1)
{printf("%d=%d+%d\n",j,k,j-k);
break;}
}
return 0;
}


int p(long a)
{
	int i;
	for(i = 2; i <= sqrt(a); i++)
	{
		if(a % i == 0)
			return 0;
	}
	return 1;
}

int main()
{
	long n, i, t;
	scanf("%ld", &n);
	for(i = 6; i <= n; i += 2)
	{
		for(t = 2; t <= i / 2; t++)
		{
			if(p(t))
				if(p(i - t))
				{
					printf("%ld=%ld+%ld\n", i, t, i - t);
					break;
				}
		}
	}
	return 0;
}


int prime[50000];
inline int isprime(int n)
{
  int i;
  if (prime[n]!=-1)return prime[n];
  else
    {
      for (i=2;i<=n/2;i++)
        {
          if ((n%i==0))
            {prime[n]=0;return 0;}
        }
      prime[n]=1;return 1;
    }
}

int main ()
{
  int n,i,k;

  for (i=2;i<50000;i++)prime[i]=-1;
  prime[2]=1;
  scanf("%d",&n);
  for (k=6;k<=n;k=k+2)
    {
      for (i=2;i<=k/2;i++)
        {
          if (isprime(i))
            {
              if (isprime(k-i))
                {
                  printf("%d=%d+%d\n",k,i,k-i);
                  break;
                }
            }
        }
    }
  return 0;
}


int main()
{
	int n,a,b,num=6;
	cin>>n;
	while(num<=n)
	{
		for(int a=3;a<=n/2;a+=2)
		{
			int countera=0;
		     double a0;
			a0=sqrt(a);
			for(int i=3;i<=a0;i+=2)
			{
				if(a%i==0) countera++;
			}
			if(countera!=0) continue;
				b=num-a;
			int counterb=0;
			double b0;
				b0=sqrt(b);
			for(int j=3;j<=b0;j+=2)
			{
				if(b%j==0)  counterb++;
			}
			if(counterb!=0) continue;
			else {
				cout<<num<<"="<<a<<"+"<<b<<endl;
			break;
			}
		}
		num+=2;
	}
	return 0;
}


int test(int x)
{
	int i;
	if(x==1) return 1;
	if(x==3) return 0;
	for(i=2;i<=sqrt(x);i++)
	{	if(x%i==0)
		{
			return 1;
		}
	}
	return 0;
}
int main()
{
	int i,j,n;
	scanf("%d",&n);
	for(i=6;i<=n;i++)
	{
		if(i%2==0)
		{
			for(j=3;j<n;j++)
			{
				if(test(j)==0)
				{
					if(test(i-j)==0)
					{
						printf("%d=%d+%d\n",i,j,i-j);
						break;
					}
				}
			}
		}
	}

	return 0;
}


int main()
{
	int n,i,j,t,k,p=1,u=1,c,x,y;
    scanf("%d",&n);
	for(i=6;i<=n;i+=2)
	{
	   for(j=3;j<=i/2;j++)
	   {
		   c=(int)sqrt(j);
		   	   if(j%2==0)
			   {
				   goto loop;
			   }
		   for(k=3;k<=c;k++)
		   {
			   if(j%k==0)
				   goto loop;
		   }
			   x=i-j;
			   y=(int)sqrt(x);
			      for(t=3;t<=y;t+=2)
				  {
				     if(x%2==0)
					 {
                        goto loop;
					 }
				     else if(x%t==0)
                        goto loop;

				  }
					   printf("%d=%d+%d\n",i,j,x);
					   goto er;
		   loop:;
	   }
er:;
	}
	return 0;
}


int sushu(int a)
{
	int b;
	int t;
    t=1;
	for(b=3;b<=sqrt(a);b=b+2)
	{
		if(a%b==0)
		{
			t=0;
			break;
		}
	}
	return t;//1shisushu,0shiheshu
}
void main()
{
	int n;
	scanf("%d",&n);
	int c,b,a;
	for(c=6;c<=n;c=c+2)
	{
		for(a=3;a<=n/2;a=a+2)
		{
			if(sushu(c-a)&&sushu(a))
			{
				printf("%d=%d+%d\n",c,a,c-a);
				break;
			}
		}
	}
}


void main()
{
	int a=3,b,m=6,i,j,n;

		scanf("%d",&n);
	while(m<=n)
	{
		while(a<=m/2)
		{

		for(i=2;i<=sqrt(a);i++)
			if(a%i==0) break;
		if(i>sqrt(a))
		{
			b=m-a;

			for(j=2;j<=sqrt(b);j++)
				if(b%j==0) break;
			if(j>sqrt(b))
			{
				printf("%d=%d+%d\n",m,a,b);
				a=3;
				break;
			}
			else
				a+=2;
		}
		else
			a+=2;
		}
		m+=2;
	}
	}


int prime(int m);
int main(void)
{
 int n,m,a,b,c,count=0;
 cin>>n;
 for(m=6;m<=n;m=m+2)
 {
	 for(a=2;a<=m/2;a++)
	 {
		 c=0;
		 b=m-a;
         if(prime(a)==1&&prime(b)==1)
		 {
			 printf("%d=%d+%d\n",m,a,b);
			 count++;
			 if(count%5==0)printf("\n");
			 c=1;
		 }
         if(c==1)break;
	 }
 }
 return 0;
}
int prime(int m)
{
 int n;
 for(n=2;n<=sqrt(m);n++)
 if(m%n==0)
 break;
 if(n>sqrt(m))
 return 1;
 else return 0;
}


int sushu (int x)
{

	if (x==2)
		return 1;
	else
	{
		int i,c;

		c=sqrt(x);
		for(i=2;i<=c;i++)
		{
			if(x%i==0)
				return 0;
		}
		return 1;
	}
}
int main(int argc, char* argv[])
{
	int n,i,j;
	scanf ("%d",&n);
	for(i=6;i<=n;i++)
	{
		if(i%2==1)
			continue;
		else
		{

			for (j=2;j<=i/2;j++)
			{
				if(sushu(j)&&sushu(i-j))
				{	 printf("%d=%d+%d\n",i,j,i-j);
				break;
				}
			}
		}

	}

	return 0;
}


int main()
{
	int i,j,k,n,a=0,b=0;
	int zhi(int x);
	scanf("%d",&n);
	for(i=6;i<=n;i++)
	{
		for(j=3;j<=i;j++)
		{
			if(zhi(j))
			{
				if(zhi(i-j))
				{
					a=j;b=i-j;break;
				}
			}
			j++;
		}
		printf("%d=%d+%d\n",i,a,b);
		i++;
	}
	return 0;
}

int zhi(int x)
{
	int i,e=0;
	for(i=2;i<=sqrt(x);i++){
		if(x%i==0){
			e=1;break;
	}}
	if(e==0)
		return (1);
	else
		return (0);
}


int Set(int c)
{
	int i,w=1;
	if (c%2==0)
	{w=0;goto loop;}
	for (i=3;i<sqrt(c)+1;i+=2)
	{
		if (c%i==0)
		{
			w=0;
		}

	}
loop:return (w);
}
int main ()
{
	long int i=6,n,j,f;
	scanf("%d",&n);
	while (i<n+1)
	{
		for (j=3;j<i;j+=2)
		{
			if(Set(j)==1)
			{
			f=Set(i-j);
			if (f==1)
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break ;
			}
			}
		}
		i+=2;
	}
	return 0;
}


int judgment(int n)
{
	int i,a=1;
	for (i=2;i<=(int)(floor( sqrt(n) ) );i++)
	{
		if (n%i==0)
			a=0;
	}
	return a;
}

int main()
{
	int n,i,j;
	scanf("%d",&n);
	for (j=6 ;j<=n;j=j+2)
	{
		for (i=3; i<=j;i=i+2)
		{
			if ((judgment(i)==0) || (judgment(j-i)==0))
				continue;
			else;
			{
				printf("%d=%d+%d\n",j,i,j-i);
				break;
			}
		}
	}
	return 0;
}


int sushu(int x)
{
	int i,n=0;
	double y;
	y=sqrt(x*1.0);
	for(i=1;i<=y;i++)
	{
		if(x%i==0)
		{
			n++;
		}
	}
	if(n==1)
	return 1;
	else return 0;

}
int main()
{
    long int n=6,m;
	long int i;
	scanf("%ld",&m);
	while(n<m+1)
	{
        for(i=3;;i++)
		{
			if(sushu(i)==1&&sushu(n-i)==1)
			{
					printf("%ld=%ld+%ld\n",n,i,n-i);
					break;
			}
		}
		n+=2;
	}
	return 0;
}


int prime(int p);
int main(){
	int n,k,i;
	scanf("%d",&n);
	for (i=6;i<=n;i+=2)
	{
		for(k=3;k<=(n/2);k+=2)
		{
			if (prime(k)+prime(i-k)==2)
			{
			printf("%d=%d+%d\n",i,k,i-k);
			break;
			}
		}
	}
return 0;
}

int prime(int n){
	int i;
	float q;

	if (n==2)
	{
		return 1;}
	else
	{
		q=(float)sqrt(n);
		for (i=2;i<=q;i++)
		{
			if(n%i==0) break;

		}
		  if(i>q) return 1;
		  else return 0;
	  }

}


void main()
{
	int n,i,j=3,a,b,c=1,d=1;
	scanf("%d",&n);
	printf("6=3+3\n8=3+5\n");
	for(i=10;i<=n;i=i+2)
       for(j=3;j<=i/2;)
	   {if (j==3)
			   for(b=2;b<i-j;b=b+1)
			       if((i-j)%b==0)
					goto loop;
				   else continue;
		else
            for(a=3;a<sqrt(j)+2;a=a+2)
			   if (j%a==0)
				   goto loop;
			   else
			   {for(b=3;b<sqrt(i-j)+2;b=b+2)
			       if((i-j)%b==0)
					goto loop;
				   else continue;
			   }
		printf("%d=%d+%d\n",i,j,i-j);break;
loop:j=j+2;}

}


int prime(int p);

int main(int argc, char* argv[])
{

   int n,k,i;
   scanf("%d",&n);
   for(i=6;i<=n;i+=2){
	   for(k=3;k<=(n/2);k+=2){
		   if(prime(k)+prime(i-k)==2){
			   printf("%d=%d+%d\n",i,k,i-k);
			   break;
		   }
	   }
   }
   return 0;
}

int prime(int p){
	int i;
	int isprime=1;
	if(p==3||p==5||p==7){
		return isprime;
	 }
	else{
		for(i=3;i<=sqrt(p);i+=2){
			if(p%i==0){
				isprime=0;
				break;
				return isprime;
			 }
		}
	}
	return isprime;
}


int sushu(int k)
{int i;
	for(i=2;i<=sqrt(k);i++)
	if(k%i==0) break;
	if(i<=sqrt(k)) return 0;
	else return 1;
}

int main()
{int n,i,m;
	scanf("%d",&n);
	n=(n%2==0)?n:n-1;
	for(m=6;m<=n;m+=2)
	{for(i=3;i<=m-1;i++)
	  if(sushu(i)&&sushu(m-i)) {printf("%d=%d+%d",m,i,m-i);break;}
	  if(m<n)printf("\n");
     }
}


int isprime(long n)
{
	long j,x;
	if(n==3) x=1;
	else
	{
	for(j=2;j<=sqrt(n);j++)
	{
	if(n%j==0)
		{x=0;
	     break;
	    }

	}
	if(j>sqrt(n)) x=1;
	}
	return(x);

}
void main()
{
   int  n,i;
   scanf("%d",&n);
   for(i=6;i<=n;i=i+2)
   {
	   int  m;
	   for(m=3;m<=(i/2);m=m+2)
	   {
		   if(isprime(m)==1&&isprime(i-m)==1)
		   {

			   printf("%d=%d+%d\n",i,m,i-m);
			   break;
		   }

	    }

   }
}


int sushu(int n)
	{
		int a=2,b=1;
		if(n%a==0)
		{
			b=0;
			return (b);
		}
		for(a=3;a<sqrt(n)+1;a+=2)
		{
			if(n%a==0)
			{
				b=0;
				break;
			}
		}
		return(b);
	}
int main(int argc, char* argv[])
{
	int m,i,p;
	scanf("%d",&p);
	for(m=6;m<p+1;m+=2)
	{
		for(i=3;i<m;i+=2)
		{
			if(sushu(i)==1&&sushu(m-i)==1)
			{
				printf("%d=%d+%d\n",m,i,m-i);
			break;
			}
		}
	}
	return 0;
}


int Isprimenumber(unsigned short int a)
{
	unsigned short int b;
    unsigned short int x;
	x=(int)sqrt(a)+1;
	for(unsigned short int i=2;i<=x;i++)
	{
		b=a%i;
		if(b==0) break;
	}
    if(b!=0) return 1;
}

int main()
{
	unsigned short int n;
    scanf("%d",&n);
    for(unsigned short int j=6;j<=n;j++)
	{
		if(j%2!=0) continue;
		else
		{
			unsigned short p;
			unsigned short q;
	        for(p=3;p<j;p++)
			{
	    		q=j-p;
				if(Isprimenumber(p)==1&&Isprimenumber(q)==1) break;
			}
			printf("%d=%d+%d",j,p,q);
	        printf("\n");
		}
	}
}


int prime(int x);
int prime(int x)
{
	int n;
	int isprime=1;
	if(x==1) {return isprime;}
	else
	{
		for(n=3;n<=sqrt(x);n=n+2)
		{
			if(x%n==0)
			{isprime=0;return isprime;break;}
		}
	}
	return isprime;
}
int main()
{
	int y,k,i;
	scanf("%d",&y);
	for(i=6;i<=y;i+=2)
	{
		for(k=3;k<=y;k=k+2)
		{
			if(prime(k)+prime(i-k)==2)
			{printf("%d=%d+%d\n",i,k,i-k);break;}
		}
	}
	return 0;
}


int a(int m)
{
	int i;float k;
	k=sqrt((float)m);
	for(i=2;i<=k;i++)
		if(m%i==0)
			break;
	if(i>k)return 1;
	else return 0;
}
void main()
{
	int w;int q;int n;
	scanf("%d",&w);
	for(q=6;q<=w;q++)
	if(q%2==0)
		for(n=3;n<=q/2;n++)
			if(n%2!=0)
				if(a(n)==1&&a(q-n)==1)
				{
					printf("%d=%d+%d\n",q,n,q-n);
					break;
				}
}


int prime(int s)
{
	int k;
	if(s%2==0)
		return 0;
	for(k=1;k<=sqrt(s)/2;k++)
	{
		if(s%(2*k+1)==0)
			return 0;
	}
	return 1;
}
int main(int argc, char* argv[])
{
	int n,i,j;
	scanf("%d",&n);
	for(i=3;i<=n/2;i++)
	{
	   for(j=3;j<=i;j++)
	   {
		 if((prime(j)==1)&&(prime(2*i-j)==1))
		 {
			 printf("%d=%d+%d\n",2*i,j,2*i-j);
			 break;
		 }
	   }
	}

	return 0;
}


int main()
{
	int prime(int x);
	int a,i,j;
	scanf("%d",&a);
	for (i=6;i<=a;i=i+2)
	{
		for (j=2;j<=i;j++)
		{
			if(prime(j)==1&&prime(i-j)==1)
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
return 0;
}

int prime(int x)
{
	int k;
	if (x==1)
		return 0;
	else if (x==2)
		return 1;
	else
	{
		for (k=2;k<=sqrt(x);k++)
		{
			if(x%k==0)
				return 0;
		}
		return 1;
	}
}


int main()
{
    int sun(int x);
    int n, m, i;
    scanf("%d", &n);
    for(m=6;m<=n;m=m+2)
    {
       for(i=3;i<=m/2;i=i+2)
       {
           if(sun(i)==1&&sun(m-i)==1)
           break; }
           printf("%d=%d+%d\n", m, i, m-i);
     }
     return 0;
}

   int sun(int x)
   {
       int j,A,t;
       t=sqrt(x);
       for(j=2;j<=t;j++)
       {if(x%j==0) break;}
        if(j>t) A=1;
        else A=2;
        return (A);
    }


int iszs(int x) {
	int a,b=0;
	for (a=2;a<=sqrt(x);a++) {
		if (x%a!=0) continue;
		else {
		  b=1;
		  break;
		}
	}
return b;
}

void main()
{
		long int i,n,a=2,c;
		scanf("%d",&n);
		for(i=6;i<=n;i=i+2)
		{
			for(a=2;a<=i/2;a++)
			{
				if(iszs(a)==0){
					c=i-a;
					if(iszs(c)==0) {printf("%d=%d+%d\n",i,a,c);break;}
				}
			}
		}

}


int main()
{
	int n,i,j,j1,k1,k,m;
	int flagj=1,flagk=1;
	scanf("%d",&n);
	for(i=6;i<=n;i+=2)
	{
		for(j=3;j<=i/2;j+=2)
		{
			flagj=1;
			flagk=1;
			k=i-j;
			j1=sqrt(j);
			k1=sqrt(k);
			for(m=2;m<=j1;m++)
				if(j%m==0)
				{
					flagj=0;
					break;
				}
			for(m=2;m<=k1;m++)
				if(k%m==0)
				{
					flagk=0;
					break;
				}
			if(flagj&&flagk)
			{
				printf("%d=%d+%d\n",i,j,k);
				break;
			}
		}
	}
}


int prime(int x);
int main(){
	int j,k,n;
	scanf("%d",&n);
	for(j=6;j<=n;j+=2)
		for(k=3;k<=(n/2);k+=2)
			if(prime(k)==10&&prime(j-k)==10){
				printf("%d=%d+%d\n",j,k,j-k);
			break;}
			return 0;
}
int prime(int x){
	int i,p=10;

	if(x==3||x==5||x==7)
		return p;
	else{
		for(i=3;i<=sqrt(x);i+=2){
			if(x%i==0){
				p=0;

			break;}
	}
	}
	return p;
}


int killer(int i)
{
	int j;
	int k;
	k=(int)sqrt(i);
	for(j=2;j<=k;j++)
	{
		if(i%j==0)
		{
			return 0;
			break;
		}
	}
	if(j==k+1)
		return 1;
}

void main()
{
	int n;
	int r,s,i;
	scanf("%d", &n);
	int t;
	t=(int)(n/2);
	int m=6;
	for(m=6;m<=n;m=m+2)
	{
		for(i=3;i<=t;i=i+2)
		{
			r=killer(i);
			if(r==1)
			{
				s=killer((m-i));
				if(s==1)
				{
					printf("%d=%d+%d\n", m,i,m-i);
					break;
				}
				else
					continue;
			}
			else
				continue;
		}
	}
}


int prime(int p);
int prime(int p)
{
	int m;
	int isprime=1;
	if(p==1) {return isprime;}
	else
	{
		for(m=3;m<=sqrt(p);m+=2)
		{
			if(p%m==0){isprime=0;return isprime;break;}
		}
	}
	return isprime;
}
int main()
{
	int n,k,i;
	scanf("%d",&n);
	for(i=6;i<=n;i+=2)
	{
		for(k=3;k<=n;k+=2)
		{
			if(prime(k)+prime(i-k)==2){printf("%d=%d+%d\n",i,k,i-k);break;}
		}
	}
	return 0;
}


int su(int i)
{
	int j;
	if(i==2)
		return 0;
	else if(i%2==0)
		return 1;
	else
	{
		for(j=3;j<sqrt(i)+1;j=j+2)
		{
			if(i%j==0)
				return 1;
		}
                   return 0;
	}
}
int main()
{
	int su(int i);
	int m,t,n;
	scanf("%d",&m);
	for(n=6;n<m+1;n=n+2)
	{
	for(t=2;t<n/2+1;t++)
	{
		if(su(t)!=1)
		{
			if(su(n-t)!=1)
			{
			printf("%d=%d+%d\n",n,t,n-t);
			break;
			}
		}
	}
	}
	return 0;
}


int check(int n) {
	int j;
	for (j=3;j<=sqrt(n);j+=2) if (n%j==0) return 0;
	return 1;
}
int main(int argc, char* argv[])
{
	int n, k, i, a;
	scanf("%d", &n);
	for (k=6;k<n+1;k+=2)
	{

			for (i=3;i<=k/2;i+=2)
			{
				if (check(i))
				{
					a=k-i;
					if (check(a))
					{
							printf("%d=%d+%d\n", k, i, a);
						    break;
					}
				}
			}

	}
	return 0;
}


int isprime(int n)
{
  int i;
  for (i=3;i*i<=n;i+=2)
    if(n%i==0)
    return 0;
  return 1;
}

void min(int s)
{
	int i;
	for (i=3;i<=s/2;i+=2)
	{
		if (isprime(i)&&isprime(s-i))
		{
			printf("%d=%d+%d\n",s,i,s-i);
			break;
		}
	}
	return;
}

int main()
{
	int ni,i;
	scanf("%d",&ni);
	for (i=6;i<=ni;i++)
	{
	  if (i%2==0)
	  min(i);
	}
	return 0;
}


int main()
{
int k,x,y,n,t;
scanf("%d",&t);
for(n=6;n<=t;n=n+2)
 {for(x=3;x<=n/2;x=x+2)
   {for(k=3;k<=sqrt(x);k++)
    if(x%k==0) break;
    if(k<=sqrt(x)) continue;
	y=n-x;
	for(k=3;k<=sqrt(y);k++)
    if(y%k==0) break;
    if(k>sqrt(y))
	   {printf("%d=%d+%d\n",n,x,y);
	    break;
	    }
    }
  }
}


int tell(int x)
{
	int i,j;
	int count=0;
	if (x==2)
		return 1;
	else if(x%2==0)
		return 0;
	j=(int)sqrt(x);
	for(i=2;i<=j;i++)
	{
		if(x%i==0)
			count++;
	}
	if(count==0)
		return 1;
	else
		return 0;
}

int main()
{
	int n;
	int i,j;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{
		for(j=3;j<i;j+=2)
		{
			if(tell(j)&&tell(i-j))
			{
				printf("%d=%d+%d\n",i,j,i-j);
		    	break;
			}
		}
	}
return 0;
}


int prime(int num)
{
	int i;
	for (i=2;i*i<=num;i++)
	{
		if (num%i==0) return 0;
	}
	return 1;
}
int main()
{
	int n,i,small;
	cin>>n;
	cout<<"6=3+3";
	for (i=8;i<=n;i=i+2)
	{
		for (small=2;2*small<=i;small++)
		{
			if (prime(small)==1&&prime(i-small)==1)
			{
				cout<<endl<<i<<'='<<small<<'+'<<i-small;
				break;
			}
		}
	}
	return 0;
}


void main()
{
	int n,k;
	scanf("%d",&n);
	k=4;
    A:k=k+2;
	while(k<=n)
	{
        int a,b;
		a=1;
        loop:a=a+2;
		int i,x;
		x=sqrt(a);
		i=(x/2)*2+1;
		while(a%i!=0)
			i=i-2;
		if(i!=1)
			goto loop;
		else
		{
			b=k-a;
			int j,y;
			y=sqrt(b);
			j=(y/2)*2+1;
			while(b%j!=0)
				j=j-2;
			if(j!=1)
				goto loop;
			else
				printf("%d=%d+%d\n",k,a,b);
			    goto A;
		}
	}
}


int f(int x)
{
	int i;
	for(i=2;i<=sqrt(x);i++)
		if(x%i==0)
			return 0;
		return 1;
}
void main()
{
	int n,i,j;
	scanf("%d",&n);
	for(i=6;i<=n;i+=2)
		for(j=3;j<=i/2;j+=2){
			if((f(j))&&(f(i-j)))
				{printf("%d=%d+%d\n",i,j,i-j);
			break;}
}
}


int sushu(int N)
{
	if (N==2||N==3)
		return 1;
	else
	{
	int d=1,i;
	for(i=2;i<=sqrt(N);i++)
	{
		 d=N%i;
		 if (d==0)
		 {
			 return 0;
			 break;
		 }
	 }
     if (d!=0)
		 return 1;
	}
}
void main()
{
	int a,b;
	unsigned int n,t,i;
	scanf("%d",&n);
	for(t=6;t<=n;t=t+2)
	{
	   for(i=2;i<=t/2;i++)
	   {
		   a=sushu(i);
		   b=sushu(t-i);
		   if (a==1&&b==1)
		   {
			   printf("%d=%d+%d\n",t,i,t-i);
		       break;
		   }
	   }
	}
}


int f(int x)
{
	int i;
	for( i=2;i<=sqrt(x);i++)
		if(x%i==0)
			return 0;
		return 1;

}
void Gede(int n)
{
	int i;
	for(i=3;i<=(n/2);i++)
	{
		if((f(i))&&(f(n-i)))
		{
			printf("%d=%d+%d\n",n,i,n-i);
			break;
		}
	}
}

int main()
{
	int n,i;
	scanf("%d",&n);
	for(i=6;i<=n;i+=2)
			Gede(i);
		return 0;
}


int isPrimeNumber(int p){
	int i,half,isPrime;
	isPrime=1;
	if ( p % 2 == 0)
		return 0;

	half = sqrt(p);
	for( i = 3; i <= half; i = i+2 ) {
		if( p % i == 0 ) {
			isPrime = 0;
			break;
		}
	}
	return isPrime;
}

int main(int n)
{
	scanf("%d",&n);
	int k;
	for(k=6;k<=n;k=k+2){

	    int i;
	    int isPrime1, isPrime2;

	    for( i = 3; i <= k/2; i = i + 2 ){
			isPrime1 = isPrimeNumber(i);
		    isPrime2 = isPrimeNumber(k-i);
		    if( isPrime1 && isPrime2 )
			{
			    printf("%d=%d+%d\n",k,i,k-i);
			    break;
			}
		}
	}
	return 0;
}


int check(int k)
{
	int i;
	int flag=1;
	if(k%2==0)
		return 0;
	for(i=3;i*i<=k;i=i+2)
		if(k%i==0)
			flag=0;

	if(flag==0)
		return 0;
	else
		return 1;

}
int main()
{
	int i;
	int j;
	int n;

	int limit;
	cin>>limit;
	for(n=6;n<=limit;n=n+2)
	  for(i=2;i<=n/2;i++)
		if(check(i)&&check(n-i))
		{
			cout<<n<<"="<<i<<"+"<<n-i;
			if(n!=limit) cout<<endl;
			break;
		}

}


int main()
{
	int shisushu(int j);
	int n,i,j;
	scanf("%d",&n);
	for(i=6;i<=n;i+=2)
	{
		for(j=2;j<=(i/2);j++)
		{
			if(shisushu(j)&&shisushu(i-j))
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
	return 0;
}

int shisushu (int j)
{int i,k;
    k=sqrt((float)j);
    for (i=2;i<=k;i++)
    {if (j%i==0) {break;}}
    if (i>k) {return 1;
    }
    else return 0;
}


int prime(int k)
{
	if(k==2)
		return 1;
	else if(k%2==0)
		return 0;
	else if(k==3)
		return 1;
	else
	{
		int i;
		for(i=3;i<=sqrt(k);i=i+2)
		{
			if(k%i==0)
				return 0;
		}
		return 1;
	}
}
int main()
{
	int n;
	scanf("%d",&n);
	int i;
	for(i=6;i<=n;i=i+2)
	{
		int j;
		for(j=3;j<i;j=j+2)
		{
			if(prime(j)==1&&prime(i-j)==1)
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
	return 0;
}


void main()
{
	int i,n,h,x,m,j;
	int sushu(int j);
	scanf("%d",&m);
	for(j=6;j<=m;j+=2)
	{
		for(i=3;i<=j/2;i+=2)
		{
			h=sushu(i);
			if(h==0) continue;
			else
			{
				x=j-i;
				h=sushu(x);
				if(h==0) continue;
				else
				{
					printf("%d=%d+%d\n",j,i,x);
				}
				break;
			}
		}
	}
}

int sushu(int i)
{
	int j,k;
	k=sqrt(i);
	for(j=2;j<=k;j++) if(i%j==0) break;
	if(j>k) return(1);
	else return (0);
}


int isprime(int p)
{
	int q,m;
	if(p%2==0) return 0;
	m=sqrt(p);
	for(q=3;q<=m;q+=2)
	{
		if(p%q==0) return 0;
	}
	return 1;
}

void main()
{
	int n,p,i;
	scanf("%d",&n);

	for(i=6;i<=n;i+=2)
	{
		for(p=3;p<=i/2;p+=2)
		{
			if(isprime(p)&&isprime(i-p))
			{
				printf("%d=%d+%d\n",i,p,i-p);
				break;
			}
		}
	}
}


int check(int num)
{
	int k=3,flag=1;
	if(num%2==0)
		flag=0;
	else if(num==3||num==5||num==7)
		flag=1;
	else
	{
		while(k<=sqrt(num))
		{
			if(num%k==0)
			{
				flag=0;
				break;
			}
			k=k+2;
		}
	}
	return flag;
}
int main()
{
	int i=6,n,num1,num2;
	scanf("%d",&n);
	while(i<=n)
	{
	    num1=3;
		while(num1<=i/2)
		{
		    if(check(num1))
		    {
              num2=i-num1;
              if(check(num2))
                  {
                     printf("%d=%d+%d\n",i,num1,num2);
                     break;
                  }
              else num1=num1+2;
		    }
		    else num1=num1+2;
		}
		i=i+2;
	}
	return 0;
}


int yes(int p){
	if(p%2==0) {
		if(p==2)
			return true;
		else
			return false;
	}
	for (int i=3;i<=sqrt(p);i+=2) {
		if(p%i==0)
			return false;
	}
	return true;
}
int main(int argc, char* argv[])
{
  int n,i,j;
  scanf("%d",&n);
  for(i=6;i<=n;i=i+2)
  {
  for(j=3;j<=i/2;j=j+2)
	{if(yes(j)&&yes(i-j))
  {printf("%d=%d+%d\n",i,j,i-j);
  break;}
	else continue;
  }
  }

	return 0;
}


void main()
{
	long prime(long);
	long x,y,t;
	long i;
	scanf("%ld",&x);
	for(t=6;t<=x;t++,t++)
    for(i=3;i<=t/2;i++,i++)
	{
	int flag1=1,j;
	for(j=3;j<=sqrt(i)&&flag1==1;j++,j++)
	{
		if(i%j==0)
			flag1=0;
	}
	if(flag1)
			y=t-i;
	int flag2=1,k;
	for(k=3;k<=sqrt(y)&&flag2==1;k++,k++)
	{
	if(y%k==0)
	flag2=0;
	}
	if(flag2)
	{
		printf("%ld=%ld+%ld\n",t,i,y);
		break;
	}
	}
}


int isprimenumber(int m)
{
	int i,isprime=1;
	if (m%2==0)
	{
		if(m==2)
		{
		return isprime;
		}
		isprime=0;
		return isprime;
	}
	for(i=3;i<=sqrt(m);i=i+2)
	{
		if(m%i==0)
		{
			isprime=0;
			break;
		}
	}
	return isprime;
}

void gb(int a)
{
	int j;
	printf("%d=",a);
	for(j=2;j<=(a/2);j=j+1)
	{
		if((isprimenumber(j))&&(isprimenumber(a-j)))
		{
			printf("%d+%d\n",j,a-j);
		    break;
		}
	}
}

int main()
{
	int n,k;
	scanf("%d",&n);
	for (k=6;k<=n;k=k+2)
	{
		gb(k);
	}
	return 0;
}


void main()
{
     int n,i,p;
     int prime(int x);
     scanf("%d",&n);
     for(i=6;i<=n;i+=2)
         for(p=3;p<=i/2;p+=2)
 	    if(prime(p)&&prime(i-p))
	    {
	       printf("%d=%d+%d\n",i,p,i-p);
	       break;
	    }
}

int prime(int n)
{
    int i,t=1;
    for(i=2;i<=sqrt(n);i++)
        if(n%i==0)
        {
	  t=0;
	  break;
        }
    return(t);
}


int isPrime(int n)
{
	int i;
	if (n%2 == 0)
		return 0;
	for (i=3; i<=sqrt(n); i++)
	{
		if ( n%i == 0 )
			return 0;
	}

	return 1;
}

int main()
{
	int n, i, j;
	scanf("%d", &n);
	for (i=6; i<=n; i+=2)
	{
		if (isPrime(i-2))
			printf("%d=%d+%d\n", i, 2, i-2);
		for (j=3; j<n/2; j+=2)
		{
			if (isPrime(j) && isPrime(i-j))
			{
				printf("%d=%d+%d\n", i, j, i-j);
				break;
			}
		}
	}
	return 0;
}


int ss(int x)
{
  double m;
  int i,f=0;
  m=sqrt(x);
  if(x%2==0) return 0;
  for(i=3;i<=m;i++)
    {
      if(x%i==0)
       {
         f=1;
         break;
       }
    }
  if(f==1) return 0;
  else return 1;
}
int main()
{
  int n,l,f,m;
  double k;
  int i,j,p;
  scanf("%d",&n);
  for(p=6;p<=n;p+=2)
  {
    l=p/2;
    for(i=3;i<=l;i+=2)
       if(ss(i)&&ss(p-i))
       {
       printf("%d=%d+%d\n",p,i,p-i);
       break;
       }
  }
    return 0;
}


void main()
{
	unsigned i,n;
	int checkN(unsigned);
	scanf("%u",&n);
	for(i=6; i<=n; i+=2)
	{
		unsigned j=0;
		for(j=3; j<=i-3;j++)
		{
			if(checkN(j) && checkN(i-j))
			{
				printf("%u=%u+%u\n",i,j,i-j);
				break;
			}
		}
	}
}
int checkN(unsigned n)
{
	if(n%2==0)
		return 0;
	else
	{
		unsigned i;
		for(i=3; i<=sqrt(n); i+=2)
		{
			if(n%i==0)
			{
				return 0;
				break;
			}
		}
		if(i>sqrt(n))
			return 1;
	}
}


int prime (int a)
{
	int i,j;
	if (a==3||a==5||a==7)
	{
		return 1;
	}
	else
	{
		for (i=3;i<=sqrt(a);i+=2)
		{
			if (a%i==0)
			{
				return 0;
				break;
			}
		}
		return 1;
	}
}
int main()
{
	int n,i,j;
	scanf("%d",&n);
	for (i=6;i<=n;i=i+2)
	{
		for (j=3;j<=i/2;j+=2)
		{
			if (prime(j)+prime(i-j)==2)
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
	return 0;
}


int sushu(int a)
{
	int i = 1;
	int j = 0;
	for(i = 1;i <= (int)sqrt(a);i = i + 2)
	{
		if((int)(a / i) * i == a)
		{
			j++;
		}
	}
	if(j == 1)
		return 1;
	else
		return 0;
}

int main()
{
	int sushu(int a);
	int n ;
	scanf("%d",&n);
	int b = 6;
	int k;
	for(b = 6;b <= n;b = b + 2)
	{
		for(k = 3;k <= (int)(b / 2);k = k + 2)
		{
			if(sushu(k) == 1 && sushu(b-k) == 1)
			{
				printf("%d=%d+%d\n",b,k,b-k);
				break;
			}
		}
		k = 3;
	}
return 0;
}


int main()
{   int prime(int n);
    int n;
    scanf("%d", &n);
    int i,j;
    for(i=6;i<=n;i=i+2)
    {
                      for(j=3;j<=n/2;j=j+2)
                      {
                                         if(prime(j)==1&&prime(i-j)==1)
                                         {
                                               printf("%d=%d+%d\n", i, j, i-j);
                                               break;
                                         }
                      }
    }
    return 0;
}

            int prime(int n)
    {
        int i;
        int flag=0;
        for(i=2;i<=sqrt(n);i++)
        {
                               if(n%i==0)
                               {
                                         flag++;
                                         break;
                               }
        }
        if(flag==1)
        {
        return 0;
        }
        else
        {
        return 1;
        }
}


int sushu(int n)
 {  int a;
    if(n==2)
	return(0);
	else if(n>2)
	{
	  for(a=2;a<=sqrt(n);a++)
	    {  if(n%a==0)
		   break;
		}
	  if(a>sqrt(n))
	  return(0);
	  else
	  return(1);
	}
}
void main()
{
  int n,a,b,c,d;
  scanf("%d",&n);
  for(a=6;a<=n;a=a+2)
    {
	  for(b=2;b<a;b++)
	  {
	    c=sushu(b);
		d=sushu(a-b);
		if(c==0&&d==0)
	    {	printf("%d=%d+%d\n",a,b,a-b);
		break;}
	   }
	 }
}


int main()
{
	int a(int n);
	int i,j,z;
	scanf("%d",&z);
    for(i=6;i<=z;i=i+2)
		for(j=3;j<=i-j;j=j+2)
			if(a(j)&&a(i-j))
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
			return 0;
}
int a(int n)
{
	int k;
	for(k=3;k<=sqrt(n);k=k+2)
		if(n%k==0)
			return (0);
		return (1);
}


int main(int argc, char* argv[])
{
	int a[30000] = {0}, n, i, j, k, temp, b=0 ;
	scanf("%d",&n);
	for (i = 3; i <= n; i++)
	{
		for (j = 2; j <= sqrt(i); j++)
		{
			if (i % j == 0) break;
			else continue;
		}
		if (j > sqrt(i))
		{
			a[b] = i;
			b++;
		}
	}
	b--;
	for (i = 6; i <= n; i += 2)
	{
		temp = 0;
		for (j = 0; j <= b; j++)
		{
			for (k = 0; k <= b; k++)
				if (i - a[j] == a[k])
				{
					temp = 1;
					break;
				}
			if (temp)
				break;
		}
		if (temp)
			printf("%d=%d+%d\n",i,a[j],a[k]);
	}
	return 0;
}


void main()
{
	int s(int x);
	int a,n,m;
	scanf("%d",&m);
	if(m<=50000)
	{
    for(n=6;n<=m;n=n+2)
	{
		for(a=3;a<=n/2;a=a+2)
			if(s(a)+s(n-a)==2)
				break;
	printf("%d=%d+%d\n",n,a,n-a);
	}
	}

}

int s(int x)
{
	int i;
	for(i=3;i<=x/2;i=i+2)
		if(x%i==0)
			break;
	if(i>x/2)
		return(1);
	else
		return(0);
}


int main()
{
	int prime(int);
	int i,n,h;
	scanf("%d",&n);
	for(h=6;h<(n+1);h=h+2)
    {for(i=3;i<=(h/2);i++)
	{
		if(prime(i)==1&&prime(h-i)==1)
		{	printf("%d=%d+%d\n",h,i,h-i);
		break;
		}
	}
    }
	return 0;
}

	int prime(int n)
	{ int i,flag=1;
	for(i=2;i*i<=n&&flag==1;i++)
	{if(n%i==0)
	flag=0;}
	return(flag);}


int main()
{
	int n,i,t,m,p,q;
	scanf("%d",&n);
	for(i=6;i<=n;i++)
	{
		if(i%2!=0)
			continue;
		else
		{
			for(t=3;t<=i/2;t++)
			{
				p=0;
				q=0;
				for(m=2;m<=sqrt(t);m++)
				{
					if(t%m==0)
					{
						p=1;
						break;
					}
					else
						continue;
				}
				for(m=2;m<=sqrt(i-t);m++)
				{
					if((i-t)%m==0)
					{
						q=1;
						break;
					}
					else
						continue;
				}
				if(p==0&&q==0)
				{
					printf("%d=%d+%d\n",i,t,i-t);
					break;
				}
				else
					continue;
			}
		}
	}
	return 0;
}


int main()
{
	int p(int x);
	int n,i,m;
	scanf("%d",&n);
	for(m=6;m<=n;m=m+2)
    for(i=3;i<=m/2;i++)
		if(p(i)==1&&p(m-i)==1)
		{
		printf("%d=%d+%d\n",m,i,m-i);
		break;
		}
	return 0;
}
    int p(int x)
	{
       int k,i,c;
	   k=(int)sqrt(x);
	   for(i=2;i<=k;i++)
		   if(x%i==0)break;
	   if(i>k)
		   c=1;
	   else
		   c=0;
	   return c;
	}


int isprime(int a)
{
	int i,sqrta;
	if(a%2==0) return 0;
	sqrta=(int)sqrt(a);
	for(i=3;i<=sqrta;i+=2)
	{
		if(a%i==0) return 0;
	}
	return 1;
}

int main(int argc, char* argv[])
{
	int n,i,j;
    scanf("%d",&n);
	for(i=6;i<=n;i+=2)
	{
		for(j=2;j<=i/2;j++)
		{
			if(isprime(j)&&isprime(i-j))
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
	return 0;
}


int prime(int a)
{
	int p=1;
	for(int i=2;i<=sqrt(a);i++)
	{
		if(a%i==0)
			p=0;
	}
	return p;
}
int main()
{
	int n,i,k,a,b;
	scanf("%d",&n);
	printf("6=3+3");
	for (i=8;i<=n;i=i+2)
	{
		for (k=3;;k=k+2)
		{
			a=prime(k);
			b=prime(i-k);
			if (a==1&&b==1)
			{
				printf("\n%d=%d+%d",i,k,(i-k));
				break;
			}
		}
	}
}


int number[50000];
int check(int x)
{
	if(x==3)return 1;
	for(int y=3;y<x;y=y+2)if(x%y==0)return 0;
	return 1;
}
int main()
{
	int n,i,j,k;
	scanf("%d",&n);
	for(i=3;i<n;i+=2)
	{
		number[i]=check(i);
	}
	for(i=6;i<=n;i+=2)
	{
		for(j=3;j<=i/2;j+=2)
		{
			if(number[j]==1&&number[i-j]==1)
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
}


main()
{ unsigned n,i,k,m,t;
scanf("%d",&n);
for(i=6;i<=n;i=i+2)
{ for(k=3;k<=i/2;k=k+2)
 {  m=i-k;
    for(t=3;t<=sqrt(k);t=t+2)
	 if(k%t==0)
		 break;
 if(t>sqrt(k))
 {	 for(t=3;t<=sqrt(m);t=t+2)
	if(m%t==0)
	  break;
	if(t>sqrt(m))
	{   printf("%d=%d+%d\n",i,k,m);
	break;
	}
 }
 }

}

}


int check(int x)
{
	int q = sqrt (x);
	int n = 0;
	int flag =1;
	for (n = 2; n <= q; n ++)
	{
		if (x % n == 0) {
			flag=0; break; }
	}
	return (flag);
}

int main()
{
	int n = 0;
	int i = 0;
	int k = 0;
	int j = 0;

	cin >> n;
	for (i = 6; i <=n; i += 2)
	{
		for (j = 2; j <= i / 2; j ++)
		{
			if (check(j))
			{
				k = i - j;
				if (check(k))
				{
					cout << i << "=" << j << "+" << k << endl;
					j = i / 2 + 1;
				}
			}
		}
	}

	return 0;
}


void main()
{
  long a,m,n,i,p,q,b,c;
  scanf("%ld",&a);
  i=6;
  m=3;

  while (i<=a)

       {
	    while (m<=i/2)
               { q=3;
                 while(q<=sqrt(m))
                      {
                       c=m%q;
                       if(c!=0){q=q+1;}
                       else {m=m+2;q=3;}
                      }

                p=2;
                n=i-m;
                while (p<=sqrt(n))
                      {
                       b=n%p;
                       if (b==0) break;
                       else p=p+1;
                      }
         if (b!=0) {printf("%ld=%ld+%ld\n",i,m,n);break;}
         else m=m+2;
        }
      i=i+2;
	  m=3;
      }
}


void main()
{
	long int x,n,i;
	long int prime(long int t);
	n=6;
	scanf("%ld",&i);
	while(n<=i)
	{
	for(x=3;x<=n/2;x=x+2)
		if(prime(x)&&prime(n-x))
			break;
		printf("%ld=%ld+%ld\n",n,x,n-x);
		n=n+2;
	}
}

long int prime(long int t)
{
	long int g,h,k;
	k=sqrt(t);
	for(h=2;h<=k;h++)
		if(t%h==0)
			break;
		if(h>k) g=1;
		else g=0;
		return(g);
}


int isprime(int a)
{
int i;
for(i=3;i<=(int)sqrt(a);i+=2)
 if(a%i==0)
return 0;
return (a==2)||(a%2!=0);
}
int main()
{
int n,i,j;
scanf("%d",&n);
for(i=6;i<=n;i+=2)
{
for(j=2;j<=i/2;j++)
if(isprime(j)&&isprime(i-j))
{
printf("%d=%d+%d\n",i,j,i-j);
break;
}
}
return 0;
}


int sushu(int a)
{
	int result,sq,sum=0,i;
	sq=sqrt(a);
	if(a==2||a==3)result=1;
	else if(a%2==0)result=0;
	else{
	for(i=2;i<=sq;i++)
	{
		if(i%2==1)
		{	if(a%i==0)break;
			sum++;
		}
	}
	if(sum==((sq-1)/2))result=1;
	else result=0;
	}
	return result;
}

int main()
{
		int n,i,j;
		scanf("%d",&n);
		for(i=6;i<=n;i++)
		{
		if(i%2==0)
			{
			for(j=2;j<=i/2;j++)
				if(sushu(j)&&sushu(i-j))
					{
						printf("%d=%d+%d\n",i,j,i-j);
						break;
					}
			}
		}
		return 0;
}


long even(long n)
{
	long t;
	if(n==2 || n==3)
		return 1;
else
{
   for(t=2;t<=sqrt(n);t++)
   {
	  if(n%t==0)
	  break;
   }
   if(t==(int)sqrt(n)+1)
	   return 1;
   else
	   return 0;
}
}
int main()
{
	long n,i,j;
	scanf("%ld",&n);
    for(i=6;i<=n;i=i+2)
	{
       for(j=3;j<i;j++)
	   {
		   if(even(j)==1&&even(i-j)==1)
		   {
			   printf("%ld=%ld+%ld\n",i,j,i-j);
		   break;
		   }
	   }
	}
}


int prime(int x)
{
  int isprime=1;
  int i;
  if(x==3||x==5||x==7){
	  return isprime;
  }
  else{
	  for(i=3;i<=sqrt(x);i+=2){
		  if(x%i==0){
			  isprime=0;
			  return isprime;
			  break;
		  }
	  }
  }
  return isprime;
}

int main()
{
    int n;
    int i,j;
    scanf("%d",&n);
	printf("6=3+3\n");
    for(i=8;i<=n;i=i+2){
      for(j=3;j<=(n/2);j=j+2){
		  if(prime(j)+prime(i-j)==2){
          printf("\n%d=%d+%d\n",i,j,i-j);
          break;
        }
      }
    }
return 0;
}


int main()
{
	int n,l,m,i,j;
	scanf("%d",&n);
	for(l=6;l<=n;l=l+2)
	{
		for(m=3;m<=l/2;m=m+2)
		{
			for(i=3;i<=sqrt(m);i++)
				if(m%i==0)break;
				if(i<=sqrt(m))continue;
			    for(j=3;j<=sqrt(l-m);j++)
				if((l-m)%j==0)break;
				if(j>sqrt(l-m))
				{
					printf("%d=%d+%d\n",l,m,l-m);
				break;
				}

		}
	}
	return 0;
}


/* Note:Your choice is C IDE */
void main()
{
   long prime(long n);
    long x=6,m=2,z;
    scanf("%d",&z);
    for(x=6;x<=z;x=x+2)
    {
    	printf("%d=",x);
    	for(m=2;prime(m)!=0||prime(x-m)!=0;m++)
    	{}
    	printf("%d+%d\n",m,x-m);

    }
}
long prime(long n)
{
	long i=2,j=0;
	while(i<sqrt(n)+1)
	{
		if(n%i==0)
		j=j+i;
		i=i+1;
	}
	return(j);
}


int prime[20000];
int vis[50001]={0};

int isprime(int x)
{
    int m=(int)floor(sqrt(x)+0.5);
    if(x%2 == 0) return 0;
    for(int i=3;i<=m;i+=2)
      if(x%i == 0)  return 0;
    return 1;
}
int main()
{
    int n,k=0;
    cin >> n;
    /*for(int i=3;i<n;i++)
      if(isprime(i)) prime[k++]=i;
    int s;
    /*for(s=6;s<=n;s+=2)
    for(int j=0;j<k;j++)
      {
         if(vis[s]==1) break;
         for(int z=j;z<k;z++)
           if(s == (prime[j] + prime[z]) && vis[s]==0)
                {
                   cout<<s<<"="<<prime[j]<<"+"<<prime[z]<<endl;
                   vis[s]=1;
                   break;
                }
      }*/
    for(int i=6;i<=n;i+=2)
     for(int j=3;;j+=2)
       if(isprime(j) && isprime(i-j))
       {
           int z=i-j;
           cout<<i<<"="<<j<<"+"<<z<<endl;
           break;
       }
    return 0;
}


void main()
{
int tashisushu(int x);
int n,fenjie,i;
scanf("%d",&n);
for(i=6;i<=n;i+=2)
	{
	for(fenjie=2;fenjie<=(i/2);fenjie++)
		{
		if(tashisushu(fenjie)+tashisushu(i-fenjie)==2)
			{
			printf("%d=%d+%d\n",i,fenjie,i-fenjie);
			break;
			}
		}
	}
}

int tashisushu(int x)
{
int i=2,c=1;
for(i;i<=sqrt(x);i++)
	{
	if(x%i==0)
		{
		return 0;
		c=0;
		break;
		}
	}
if(c==1)
	return 1;
}


int main()
{
	int n,i,j=0;
	int prime[5200]={0};
	scanf("%d",&n);
	int primjud(int x);
	for(i=3;i<n;i=i+2)
	{
		if(primjud(i)==0) prime[j]=i;
		if(prime[j]!=0) j=j+1;
	}
	int t=j;
	for(i=6;i<=n;i=i+2)
	{
		int b=0;
		for(j=0;j<t;j++)
		{
			if(primjud(i-prime[j])==0) {b=1;break;}
		}
		if(b==1) printf("%d=%d+%d\n",i,prime[j],i-prime[j]);
	}
	return 0;
}

int primjud(int x)
{
	int i,b=0;
	for(i=3;i<sqrt(x)+1;i=i+2)
		if(x%i==0) {b=1;break;}
	if(x==9) b=1;
	if(b==1) return 1;
	else return 0;
}


main()
{
long int i,j,s,t,p;
long int n;
scanf("%d",&n);
for(i=6;i<=n;i=i+2)
    for(s=3;s<i;s=s+2)
	{   for(t=2;t<sqrt(s)+1;t++)
		    {if(s%t==0)
	            break;
             if(t>=sqrt(s))
				{j=i-s;
                 for(p=2;p<sqrt(j)+1;p++)
				    {if(j%p==0)
					     break;
				     if(p>=sqrt(j))
					 {printf("%ld=%ld+%ld\n",i,s,j);
					 s=i-1;}
				    }
				}
		    }
	}

}


	int su(int a)
	{  int i,b;
	   b=(int)sqrt(a);
	   for (i=2;i<=b;i++)
	   { if (a%i==0) {
		   return 0;
	   }
       }
	   return 1;

	}

int main()
{	int n,i,j;
    scanf("%d",&n);
	for (i=6;i<=n;i+=2)  {
		for (j=2;j<=i/2;j++)
			if(su(j)==1 && su(i-j)==1) {
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	return 0;
}


int main(int argc, char* argv[])
{
	int n,i,m=6,zyk(int x);
	scanf("%d",&n);
    while(m<=n)
	{
		for(i=3;i<=m/2;i+=2)
		{
			if(zyk(i)==1 && zyk(m-i)==1)
			{
				printf("%d=%d+%d\n",m,i,m-i);
				break;
			}
		}
		m+=2;
	}

	return 0;
}
int zyk(int x)
{
	int i;
	for(i=3;i<sqrt(x)+1;i+=2)
	{
		if(x%i==0)
			return 0;
	}
	return 1;
}


void main()
{
	int judge(int x);
	int n,m,i,j;
	scanf("%d",&n);
	for (i=6;i<=n;i=i+2){
		for (j=3;j<n/2;j++){
			if (judge(j) && judge(i-j)){
				printf("%d=%d+%d\n",i,j,i-j);
				break;}
			}
	}
}

int judge(int x)
{
	int flag=1,i,y;
	y=sqrt(x);
	for (i=2;i<=y && flag==1;i++)
		if (x%i==0)
			flag=0;
	return(flag);
}


int isprime(int n)
{
	int i;
	if(n==2||n==3||n==5||n==7)
		return 1;
	else
	{
		if(n==1||n==4||n==6||n==8||n==9||n==10)
			return 0;
		else
		{
			for(i=2;i<=sqrt(n);i++)
				if(n%i==0)break;
			if(i>sqrt(n))
				return 1;
			return 0;
		}
	}
}
int main()
{
	int n,i,j;
	scanf("%d",&n);
	for(i=6;i<=n;i+=2)
	{
		for(j=2;j<i;j++)
		{
			if(isprime(j)&&isprime(i-j))
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
	return 0;
}


int main()
{
	int n,i,j,k,t,p,x,a;
	scanf("%d",&n);
	t=n/2;
	for (i=6;i<=n;i+=2)
	{
		for (j=3;j<=t;j++)
		{
			if (j%2==0)
				goto loap;
			else if (j>2)
			{
				p=sqrt(j);
					for (k=3;k<=p;k+=2)
					{
						if (j%k==0)
							goto loap;
					}
			}
			a=i-j;
			x=sqrt(a);
			if (a%2==0)
				goto loap;
			else
			{
				for (k=3;k<=x;k+=2)
					if (a%k==0)
						goto loap;
			}
			printf("%d=%d+%d\n",i,j,a);
			break;
		loap:;
		}
	}
return 0;
}


int IsPrime(int m)
{
	int high,i;
	high=sqrt(m);
	for (i=3;i<=high;i+=2)//?????m????
	{
		if(m%i==0) break;
	}
	if(i>high) return 1;
	return 0;
}
void Out2prime(int m)
{
	int a,b;
	for (a=3;a<=m/2;a+=2)
	{
		b=m-a;
		if(IsPrime(a)&&IsPrime(b))
		{
			printf("%d=%d+%d\n",m,a,b);
			break;
		}
	}
}
int main()
{
	int n,i;
	scanf("%d",&n);
	for (i=6;i<=n;i+=2)
	{
		Out2prime(i);
	}
	return 0;
}


int is_prime(int n)
{
	int i;
	if(n==1)
		return(0);
	for(i=2;i<=sqrt(n);)
	{
		if(n%i==0)
		{
			return(0);

		}
		else
		{
			i++;
		}

	}
	return(1);

}

main()
{
	int k;
	int i;
	int n;
	scanf("%d",&n);
	for(k=6;k<=n;k=k+2)
	{
		for(i=2;i<=k/2;i++)
		{
			if(is_prime(i)==1&&is_prime(k-i)==1)
				break;
		}
		printf("%d=%d+%d\n",k,i,k-i);

	}

}


int fun(int);
void main()
{
	int i,n,a,j,b;
	scanf("%d",&n);
	for(j=6;j<=n;j+=2)
		for(i=2;;i++)
		{
			a=fun(i);
	        b=fun(j-i);
     		if(a&&b)
			{
	    		printf("%d=%d+%d\n",j,i,j-i);break;
			}
		}
}
int fun(int t)
{
	int i,p=1;
	for(i=2;i<=(int)sqrt(t);i++)
	{
		if(t%i==0)
		{
			p=0;break;
		}
	}
	return p;
}


int f(int x){
	int i,t=0;
	for(i=2;i*i<x;i++)
	{
		if(x%i==0) break;
	}
	if(i*i>x) t=1;
	return t;
}

int main()
{
	int n;
	scanf("%d",&n);

	int i,j;
	int t1,t2;
	int x;
	for(i=6;i<=n;i=i+2)
	{
		for(j=3;j<i;j=j+2)
		{
			x=i-j;
			t1=f(j);
			t2=f(x);
			if(t1==1 && t2==1)
			{
				printf("%d=%d+%d\n",i,j,x);
				break;
			}
		}

	}
	return 0;
}


int primes[20000];
/*
int isPrimeNumber(int p)
{
	int i;
	for(i=0;;i++)
	{
		if( primes[i]==p )  return 1;
		if( primes[i]>p ) break;
	}
	return 0;
}
*/
int isPrimeNumber(int p)
{
	int j;
	for(j=0; primes[j]*primes[j]<p; j++)
	{
		if( p%primes[j]==0 ) return 0;
	}
	if( primes[j]*primes[j]>p ) //??i??????????????????
	{
		return 1;
	}
	return 0;
}

void AllPrimes(int n)
{
	int number=1;     //??n??????
	int i, j;         // ????
	primes[0] = 2;    //2??????
	for( i = 3; i <= n; i = i + 2 )
	{      //??i???????????
		for(j=0; primes[j]*primes[j]<i; j++)
		{
			if( i%primes[j]==0 ) break;
		}
		if( primes[j]*primes[j]>i ) //??i??????????????????
		{
			primes[number] = i;
			number++;
		}
	}
}

int main()
{
	int n;
	scanf("%d",&n);
	int j;

	AllPrimes(n);

	for(j=6;j<=n;j+=2)
	{
		int half = j/2;
		int i;
		int isPrime1, isPrime2;

		for( i = 3; i <= half; i = i + 2 )
		{
			isPrime1 = isPrimeNumber(i);
			isPrime2 = isPrimeNumber(j-i);
			if( isPrime1 && isPrime2 )
			{
				printf("%d=%d+%d\n", j, i, j-i);
				break;
			}
		}
	}
	return 0;
}


int F(int);
void main()
{
	int i,n,f1,k,f2;
	scanf("%d",&n);
	for(k=6;k<=n;k=k+2)
		for(i=2;i<n;i++)
		{
			f1=F(i);
	        f2=F(k-i);
     		if(f1&&f2)
			{
	    		printf("%d=%d+%d\n",k,i,k-i);break;
			}
		}
}
int F(int t)
{
	int i,p=1;
	for(i=2;i<=sqrt(t);i++)
	{
		if(t%i==0)
		{
			p=0;break;
		}
	}
	return p;
}


void main()
{
	int n,i,j,k,t,m;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{
		j=i-2;
		for(k=2;k<=sqrt(n);k++)
		{
			if(j%k!=0)
				continue;
			else
				goto loop1;
		}
			printf("%d=2+%d\n",i,j);
		loop1:if(1);
		for(t=3;t<=n/2;t=t+2)
		{
			for(m=3;m<=sqrt(t);m=m+2)
			{
				if(t%m==0)
					goto loop2;
				else
					continue;
			}
			j=i-t;
			for(k=2;k<=sqrt(j);k++)
			{
				if(j%k!=0)
					continue;
				else
					goto loop2;
			}
				printf("%d=%d+%d\n",i,t,j);
				break;
				loop2:if(1);
		}
	}
}


 int main()
 {
	 int n;
	 scanf("%d",&n);
	 int number=1;
	 int primes[100000];
	 int i, j;
	 primes[0] = 2;
	 for( i = 3; i <= n; i = i + 2 )
	 {
	 	 for(j=0; primes[j]*primes[j]<i; j++)
		 {
			 if( i%primes[j]==0 )
				 break;
		 }
		 if( primes[j]*primes[j]>i)
		 {
			 primes[number]=i;
		     number++;
		 }
	 }
	 int k,l,m,p;
	 for (k=6;k<=n;k=k+2)
	 {
		 for (l=0;primes[l]<=k/2;l++)
		 {
			 m=k-primes[l];
			 for (p=0;primes[p]*primes[p]<k;p++)
			 {
				 if (m%primes[p]==0)
				 {
					 break;
				 }
			 }
			 if (primes[p]*primes[p]>k)
			 {
				 printf("%d=%d+%d\n",k,primes[l],m);
				 break;
			 }
		 }
	 }
	 return 0;
 }


int main()
{
		int flag(int t);
		int i,j,n,sign=0;
		cin>>n;
		for(i=6;i<=n;i+=2,sign=0)
		{
			for(j=3;j<=n/2&&sign==0;j+=2)
				if(flag(j))
					if(flag(i-j))
						{cout<<i<<'='<<j<<'+'<<i-j<<endl;
						sign=1;
						}
		}

}

int flag(int t)
{
	int i,sign=0;
	if(t==3||t==5)
		return 1;
	else
		for(i=3;i<=sqrt(t)&&sign==0;i+=2)
			if(!(t%i))
				{return 0;
				sign=1;
				}

	if(sign==0)
		return 1;
}


int prime(int a){
	int i;
	int isprime=1;
	if (a == 3 ||a == 5 || a == 7)
		return isprime;
	else{
		for(i=3;i<=(int)sqrt(a);i+=2){
			if (a%i==0){
				isprime=0;
				return isprime;
				break;
			}
		}
	}
	return isprime;
}

int main(int argc, char* argv[])
{
	int n,i,j;
	scanf("%d",&n);
	for (i=6;i<=n;i+=2){
		for (j=3;j<=i/2;j+=2){
			if(prime(j)+prime(i-j)==2){
				printf ("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
	return 0;
}


int prime(int x){  //????????
	int i;
	if(x==2)
		return 1;
	for(i=3;i<=sqrt(x);i++){
		if(x%i==0){
			return 0;
			break;
		}
	}
	return 1;
}
void main(){
	int n;
	int i,j;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2){
		for(j=3;j<=i/2;j+=2){
			if(prime(j) && prime(i-j)){
				printf("%d=%d+%d\n",i,j,(i-j));
				break;
			}
		}
	}
}


int f(int x);
void main()
{
	int n;
	scanf("%d",&n);
	int i=0,j=0;
	for(i=6;i<=n;i=i+2)
	{   printf("%d=",i);
		for(j=3;j<=i;j=j+2)
		{if(f(j)==1&&f(i-j)==1) {printf("%d+%d\n",j,i-j); break;}
		else continue;
		}
}
}
		int f(int x)
 { int k=0,i=0,o=0;
	 if(x%2==0) return 0;
	 else
	 {	for(i=3;i<=sqrt(x);i+=2)
	 if(x%i==0)
	 {return 0;
	 o++;
	 break;
	 }
	 if(o==0) return 1;
 }
		}


int prime[50001];
int isPrime(int a)
{
        if(prime[a] == 1)
                return 1;
        if(prime[a]==2)
                return 0;
        if(a%2==0 && a!=2)
        {
                prime[a]=2;
                return 0;
        }
        for(int i=3;i*i<=a;i+=2)
                if(a%i==0)
                {
                        prime[a]=2;
                        return 0;
                }
        prime[a]=true;
        return 1;
}
int main()
{
        int n;

        cin>>n;
        prime[2]=1;
        for(int i=6;i<=n;i+=2)
        {
                if(isPrime(i-2))
                        {
                                cout<<i<<"="<<2<<"+"<<(i-2)<<endl;
                                continue;
                        }

                for(int j=3;j*2<=i;j+=2)
                {
                        if(isPrime(j)&&isPrime(i-j))
                        {
                                cout<<i<<"="<<j<<"+"<<(i-j)<<endl;
                                break;
                        }
                }
        }
        return 0;
}


void main()
{int j,b,gede(int);
	scanf("%d",&b);
for (j=6;j<=b;j=j+2)
gede(j);
}
int gede(int n)
{
int i,d,sushu(int);
d=n/2;
for (i=3;i<=d;i=i+2)
         if (sushu(i)==1&&sushu(n-i)==1)
		 {printf("%d=%d+%d\n",n,i,n-i);
		 break;}
return(0);
		 }
int sushu(int a)
{int i,b,ok;
ok=1;
b=sqrt(a)+1;
for (i=2;i<=b;i++)
if (a%i==0)
    ok=0;
return(ok);
}


int main()
{

	int n,k;
	int p,m,i;
	int q;
	int sign=1;

	scanf("%d",&n);

	for(k=6;k<=n;k=k+2)
	{
		for(p=3;p<=k/2;p=p+2)
		{
			sign=1;
			m=(int)sqrt((double)p);
			for(i=3;i<=m;i=i+2)
			{
				if(p%i==0)
				{
					sign=0;
					break;
				}
			}

			if(sign==0)
				continue;

			q=k-p;
			m=(int)sqrt((double)q);
			for(i=3;i<=m;i=i+2)
			{
				if(q%i==0)
				{
					sign=0;
					break;
				}
			}
			if(sign==1){
				printf("%d=%d+%d\n",k,p,q);
				break;
			}
		}

	}

}


int sushu(int n);
int main()
{
	int n,i,j,t;
	scanf("%d",&n);
	for(t=6;t<=n;t=t+2)
	{
		for(i=1;i<=t/2;i++)
		{
			j=1;
			if(sushu(i))
			{
				j=t-i;
				if(sushu(j))
				{
					printf("%d=%d+%d\n",t,i,j);
					break;
				}
			}
		}
	}
	return 0;
}
int sushu(int n)
{
	int i,m=0;
	if(n==0) return 0;
	if(n==1) return 0;
	for(i=2;i<=sqrt(n);i++)
	{
		if(n%i==0) m=m+1;
	}
	if(m!=0) return 0;
	else return 1;
}


int isprime(int x)
{
	if(x==1) return 0;
	if(x==2) return 1;
    for(int i=2;i<=sqrt(x);i++)
	{
		if(x%i==0)
		{
			return 0;
		}
	}
	return 1;
}
int main()
{
	int n;
	scanf("%d",&n);
	int i,j;
	for(i=6;i<=n;i=i+2)
	{
		for(j=3;j<=i/2;j=j+2)
		{
			if(isprime(j)&&isprime(i-j))
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
	return 0;
}


int evennumber(int x)
{
	int i;
	for(i=2;i<=sqrt(x);i=i+1)
	{
		if(x%i==0)
		{
			return(0);
			break;
		}
	}
	if(i>sqrt(x))
		return(1);
}
void main()
{
	int n=6,m,k,o,p,e=2;
	scanf("%d",&m);
	for(n=6;n<=m;n=n+2)
	{

		for(e=3;e<n;e=e+2)
		{
			k=n-e;
			o=evennumber(k);
			p=evennumber(e);
			if(o==1&&p==1)
				break;
			else
				continue;
		}
		printf("%d=%d+%d\n",n,e,k);
	}
}


int judge(int a)
{
   int k;
   for(k=3;k*k<=a;k+=2)

      if(a%k==0)
      return 0;
   return 1;
}

void main()
{
   int n,j,i;
   scanf("%d\n",&n);
   for(j=6;j<=n;j+=2)
      for(i=3;i<=(j/2);i+=2)
      {
         if(judge(i)&&judge(j-i))
            {
             printf("%d=%d+%d\n",j,i,j-i);
             break;
            }
      }
return 0;

}


int main()
{
	int i,n;
	int a,b;
	int p;
	int fla,flb;
	cin>>n;
	for(i=6;i<=n;i=i+2)
	{
		for(a=3,b=i-3;a<=b;a=a+2,b=b-2)
			{
				fla=1;
		        flb=1;
				p=3;
				while(p<=sqrt((double)a))
				{
					if(a%p==0)
					{
						fla=0;
						break;
					}
					else
						p=p+2;
				}

				if(fla==0)
					continue;

				p=3;
				while(p<=sqrt((double)b))
				{
					if(b%p==0)
					{
						flb=0;
						break;
					}
					else
						p=p+2;
				}

				if(flb==0)
					continue;
				else
					{
						cout<<i<<"="<<a<<"+"<<b<<endl;
						break;
				    }
		}

	}
	return 0;

}


int sushu(long n)
{
    long i;
    if(n==3||n==5||n==7)
        return 0;
    else
    {for(i=3;i<=sqrt(n);i++)
    {
        if(n%i==0)
          break;
     }
     if(i>sqrt(n))
           return 0;
     else
           return 1;}
}
main()
{
    long n;
    scanf("%ld",&n);
     long i,j;
     for(i=6;i<=n;i=i+2)
     {

         for(j=3;j<=i/2;j=j+2)
         {
               if(sushu(j)==0&&sushu(i-j)==0)
               {
                     printf("%d=%d+%d\n",i,j,i-j);
                     break;
               }
         }
    }

}


void main()
{
	int n,k;
	scanf("%d",&n);
	for(k=6;k<=n;k=k+2)
	{
        int a=1,b;
   loop:a=a+2;
		int i,x=sqrt(a);
		for(i=(x/2)*2+1;a%i!=0;)
			i=i-2;
			if(i!=1)
			goto loop;
		else
		{
			b=k-a;
			int j,y=sqrt(b);
			for(j=(y/2)*2+1;b%j!=0;)
				j=j-2;
				if(j!=1)
				goto loop;
			else
				printf("%d=%d+%d\n",k,a,b);
		}
		continue;
	}
}


int p(int n)
{
	int i,j;
	j=sqrt(n);
	if(n%2==0)
		return 0;
	else
	{
		for(i=3;i<=j;)
		{
			if(n%i==0)
			break;
			i=i+2;
		}
		if(i>j)
			return 1;
		else
			return 0;
	}
}
void main()
{
	int n,m,i,j;
	scanf("%d",&n);
	for(m=6;m<=n;)
	{
		for(i=2;i<=(m/2);i++)
		{
			j=m-i;
		if(p(i)==1 && p(j)==1)
			break;
		}
		printf("%d=%d+%d\n",m,i,j);
		m=m+2;
	}
}


int prime(int a)  //a must be an odd.
  {
  int k,m;
  m=1;
   for(k=3;k<=sqrt(a);k++)
      if(a%k==0)
	  {
	   m=0;
	   break;
	  }
   return m;
   }
int main()
{
 int n,i,j;
 scanf("%d",&n);
 for(i=6;i<=n;i+=2)
 {
   for(j=3;j<i;j+=2)
      if(prime(j)==1&&prime(i-j)==1)
	    {
		  printf("%d=%d+%d\n",i,j,i-j);
		  break;
		}
 }
}


int main()
{
	int n,i,j;
	char isprime[maxn+1]={0,0};
	scanf("%d",&n);
	for(i=2;i<=n;i++)
	{
		isprime[i]=1;
	}
	for(i=2;i<=n;i++)
	{
		if(isprime[i]){
			for(j=i+i;j<=n;j+=i){
				isprime[j]=0;}
		}
	}
	for(i=6;i<=n;i+=2){
			for(j=2;j<=i/2;j++){
				if(isprime[j]&&isprime[i-j]){
					printf("%d=%d+%d\n",i,j,i-j);
					break;}
			}
	}
	return 0;
}


void main()
{
	long int a,i;i=6;
	scanf("%d",&a);
	while (i<=a)
	{
		long int x,y;
		x=1;y=3;
		while(i!=x+y)
		{
nextx:   	{
				x=x+2;
				int k;
				k=sqrt(x);
				int p=2;
				while(p<=k)
				{if(x%p==0)break;
				p=p++;}
				/*for(int p=2;p<=k;p++)
					if(x%p==0) break;*/
				if(p<=k) goto nextx;

			}
			y=i-x;
			{
				    int u;
				    u=sqrt(y);
					int v=3;
					while(v<=u)
					{if(y%v==0)break;v=v+2;	}
				    /*for(int v=3;v<=u;v=v+2)
					    if(y%v==0) break;*/
				    if(v<=u) goto nextx;
			}

		}
	printf("%d=%d+%d\n",i,x,y);
	i=i+2;
	}
}


int main(void)
{
int primeNo(int);
int m,k,i,t,q,n;
scanf("%d",&m);
if(m<8)
printf("6=3+3");
else
	{
	printf("6=3+3");
	for(n=8;n<=m;n+=2)
		{
		for(i=3;i<=(n/2);i+=2)
				{
				q=n-i;
				if(primeNo(i)&& primeNo(n-i))
				{
					printf("\n%d=%d+%d",n,i,q);
					break;
				}
				}
			}

	}
}
int primeNo(int n)
{
int k,i;
k=sqrt(n);
for(i=3;i<=k;i+=2)
		{
		if(n%i==0)
		break;
		}
	if(i<=k)
	return 0;
	else
	return 1;
}


long prime(long x)
{
	long i;
	for (i=2;i<=sqrt(x);i++)
	{
		if (x%i==0)
		{
			return 0;
			break;
		}
	}
	return 1;
}

void main()
{
	long n,j;
	long i=6;
	scanf("%ld",&n);
		while (i!=(n+2))
		{
			for(j=3;j<=i/2;j++)
			{
				if(prime(j)==1&&prime(i-j)==1)
				{
					break;
				}
			}
			printf("%ld=%ld+%ld\n",i,j,(i-j));
			i=i+2;
		}
}


int f(int a)
{
	int i,e;
	if(a%2==0)
		return 0;
	e=(int)sqrt(a);
	for(i=3;i<=e;i+=2)
		if(a%i==0)
			return 0;
	return 1;
}
void main()
{
	int n,i,j;
	scanf("%d",&n);
	for(i=6;i<=n;i+=2)
		for(j=2;j<=i/2;j++)
			if(f(j) && f(i-j))
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
}


int main()
{
	int n,i,j,t,k,p=1,u=1,c,x,m,y;
    scanf("%d",&n);
	for(i=6;i<=n;i+=2)
	{
		m=(int)i/2;
	   for(j=3;j<=m;j++)
	   {
		   c=(int)sqrt(j);
		   	   if(j%2==0)
			   {
				   goto loop;
			   }
		   for(k=3;k<=c;k++)
		   {
			   if(j%k==0)
				   goto loop;
		   }
			   x=i-j;
			   y=(int)sqrt(x);
			      for(t=3;t<=y;t+=2)
				  {
				     if(x%2==0)
					 {
                        goto loop;
					 }
				     else if(x%t==0)
                        goto loop;

				  }
					   printf("%d=%d+%d\n",i,j,x);
					   goto er;
		   loop:;
	   }
er:;
	}
	return 0;
}


int sushu(long a)
{
	long i;
	for(i=2;i<=(int)sqrt(a);i++)
		if(a%i==0)
			break;
	if(i==(int)sqrt(a)+1)
		return 1;
	return 0;
}
void main()
{
	long n,i,j;
	scanf("%ld",&n);
	for(j=6;j<=n;j+=2)
	{printf("%d=",j);
	for(i=2;i<=j/2;i++)
		if(sushu(i)&&sushu(j-i))
		{printf("%d+%d\n",i,j-i);break;}
	}
}


int main()
{int n,i,j;
 int panduan(int x);
 scanf("%d",&n);
   for(i=6;i<=n;i++)
      if(i%2==0)
        {printf("\n%d=",i);
          for(j=2;j<=i;j++)
            {
             if(panduan(j)==1&&panduan(i-j)==1)
             {printf("%d+%d",j,i-j);
              break;}
            }
        }
}
int panduan(x)
{int a;
  if(x==2||x==3)return 1;
  else
  {
  {for(a=2;a<=sqrt(x);a++)
    if((x%a)==0)break;
   }
    if((x%a)==0) return 0;
    else return 1;}
  }


void main()
{
	int n;
	int tag;
	int i, j, k;

	scanf("%d", &n);
	for(i = 6; i <= n; i = i + 2)
	{
		for(j = 3; j < i; ++j)
		{
			tag = 0;
			for(k = 2; k * k <= j; k++)
				if(j % k == 0)
				{
					tag = 1;
					break;
				}
			if(tag == 1)
				continue;
			for(k = 2; k * k <= i - j; k++)
				if((i - j) % k == 0)
				{
					tag = 1;
					break;
				}
			if(tag == 1)
				continue;
			printf("%d=%d+%d\n", i, j, i-j);
			break;
		}
	}
}