semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
int prime(int x)
{   int b=1;
    if(x==3||x==5||x==7)
    {return b;}
    else
    {
        for(int i=3;i<=sqrt(x);i+=2)
        { 
            if(x%i==0)
            {     
                  b=0;
                  return b;
                  break;
            }
        }
    }
    return b;
}
int main()
{   
    int o;
    int n,a;
    scanf("%d",&n);
    for(int i=6;i<=n;i+=2)
    {       int s=i/2;
            for(a=3;a<(n/2);a+=2)
            { 
                            
                            if(prime(a)+prime(i-a)==2)
                            {
                                         printf("%d=%d+%d\n",i,a,i-a);break;
                                         
                            }  
                                 
            }     
    }
                            
    
     scanf("%d",&o);
    return 0;
}
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);
}
int main()
{
unsigned int n,l,x,y;
scanf("%d",&n);
unsigned int i,k,p;
for(i=6;i<=n;i=i+2)
	{p=0;
	for(k=3;k<=i/2;k=k+2)
		{
		if(p==1)
			continue;
		else
			l=i-k;
		int prove(int x);
		x=prove(k);
		y=prove(l);
		if(x==1&&y==1)
			{p=1;
			printf("%d=%d+%d\n",i,k,l);}
		else
			p=0;
		}		
	}
return(0);
}
void main()
{
	int n,i,j,k,l,a;
		scanf("%d",&n);
		for(i=6;i<=n;i=i+2)
		{
			a=0;
		   for(k=2;k<=sqrt(i-3);k++)
			  if((i-3)%k==0) break;
			  if(k>sqrt(i-3)) printf("%d=3+%d\n",i,i-3);
			  else for(j=5;j<=i-5;j++)
			  { 
				  for(k=2;k<=sqrt(j);k++)
					  if(j%k==0) break;
					  if(k>sqrt(j)) 
			       {
					for(l=2;l<=sqrt(i-j);l++)
					 if((i-j)%l==0) break;
				     if(l>sqrt(i-j))
					 {
						 a++;
			            printf("%d=%d+%d\n",i,j,i-j);
					 }
					 
				}if(a==1) break;
		}
}
}
long n;
long zhishu(int a)
{ 
	for(int i=2;i<=sqrt(a);i++)
	{    
		if(a%i==0)
        return 0;
	}
return 1;
}
main()
{
 scanf("%d",&n);
 int i,j;
 for(i=6;i<=n;i=i+2)
    for(j=3;j<=(i/2);j=j+2)
      {
      if(zhishu(j)&&zhishu(i-j))
	  {
	  printf("%d=%d+%d\n",i,j,i-j);
	  break;
	  }
	}
return 0;
}
void main()
{
	long int u,p,a,q,n,i,j,k,m,r;
	scanf("%d",&n);
	for(i=6;i<=n;i++,i++)
	{
		for(j=3;j<=i/2;j++,j++)
		{
			p=sqrt(j);
			for(k=1;k<=p;k++,k++)
			if (k!=1)
			{r=j%k;
			if(r==0)  
				break;
			}
			if (k>p)
			{ q=i-j;
			u=sqrt(q);
			for(m=1;m<=u;m++,m++)
			if(m!=1)
			{a=q%m;
			if(a==0) break;
			}
			if(m>u&&q>=3) {printf("%d=%d+%d\n",i,j,q);break;}
			}
		}
	}
}
int ss(int x){
              int i,j;
              j=1;
              if(x==2)return(1);
              else {if((x%2)==0)return(0);else{
                   for(i=3;i<=sqrt(x);i=i+2){
                                            if((x%i)==0){j=0;break;}
                                            }
                    if(j==1)return(1);else return(0);
                    } }                       
              }
main(){
       int n,i,j;
       scanf("%d",&n);
       for(i=6;i<=((n/2)*2);i=i+2){
                                   for(j=2;j<=((i/2)+1);j++){
                                                             if((ss(j)==1)&&(ss(i-j)==1)){printf("%d=%d+%d\n",i,j,i-j);break;}
                                                             }
                                   
                                   }
       }
int isprime(int a)
{ 
	int i;
	for(i=3;i<=(int)sqrt(a);i=i+2)
		if(a%i==0)return 0;

		return (a==2)||(a%2!=0);
}

void main()
{int n,i,j;
 scanf("%d",&n);
 for(i=6;i<=n;i=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;
	
		 }
	}

}
int n, i, j, k, f;

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

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

int main()
{
	int n,i,j;
	scanf("%d",&n);
	for(j=6;j<=n;j++)
	{
		if(j%2==0)
		{
			for(i=2;i<=j;i++)
			{
				if(sushu(i)&&sushu(j-i)==1)
				{
			        printf("%d=%d+%d\n",j,i,j-i);
					break;
				}
			}
		}
	}
	
	return 0;
}
main()
{
	int n,m,i,j,k,x,l,t;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{
		m=i/2;
		for(j=3;j<=m;j=j+2)
		{
			x=0;
			l=sqrt(j);
			for(k=1;k<=l;k++)
			{
				if(j%k==0)
				x++;
			}
			if(x==1)
			{
				x=0;
				t=i-j;
				l=sqrt(t);
				for(k=1;k<=l;k++)
				{
					if(t%k==0)
					x++;
				}
				if(x==1)
				{printf("%d=%d+%d\n",i,j,t);
				break;}
			}
		}
	}
}
int k(int p){
	int i,h,a=1;
	if(p%2==0){
		if(p==2){
			return a;
		}
		a=0;
		return a;
	}
	h=p/2;
	for(i=3;i<=h;i++){
		if(p%i==0){
			a=0;
			break;
		}
	}
	return a;
}
		
int main(){
    int n,i,m;
	int k1,k2;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2){
		for(m=2;m<=i;m++){
		   k1=k(m);
		   k2=k(i-m);
		   if(k1==1&&k2==1){
			   printf("%d=%d+%d\n",i,m,i-m);
			   break;
		   }
		}
	}
	return 0;
}
main ()
{
int j,m,n,p,q,flagp,flagq ;
scanf("%d",&m) ;
for(n=6;n<=m;n=n+2)
{
p = 1 ;
do {
p = p + 1 ;
q = n - p ;
flagp = 1 ;
for(j=2;j<=(int)(floor(sqrt((double)(p))));j++)
{
if ((p%j)==0)
{
flagp = 0 ;
break ;
}
}
flagq= 1 ;
for (j=2;j<=(int)(floor(sqrt((double)(q))));j++)
{
if ((q%j)==0)
{
flagq = 0 ;
break ;
}
}
} while (flagp*flagq==0);
printf("%d=%d+%d\n",n,p,q) ;
}
}
int main()
{   
	int n,i,k,t,u,m,q=0,c;
	scanf("%d",&n);
	for(i=6;i<=n;i+=2)
	{
		for(k=3;k<=i;k++)
		{
			t=0;u=0;c=0;
			for(m=2;m<=(int)sqrt(k);m++)
			{
				if(k%m==0) t=1;
			}

			if (t==0) 
			{
                q=i-k;
				for(m=2;m<=(int)sqrt(q);m++)
				{
					if(q%m==0) u=1;
				}
			    if (u==0) {printf("%d=%d+%d\n",i,k,q);c=1;break;}
			}
		if(c==1) break;	
		}
	}
	return 0;
}
void main()
{
	int i,n,p,m,k,a[50000],q=0,r,j,w;
    scanf("%d",&n);

    for(k=3;k<=n;k++)
	{
	    m=sqrt(k)+1;
		p=0;
		for(i=2;i<m;i++)
		{
			if(k%i==0)
			p=p+1;
		}
		if(p==0)
		{
			a[q]=k;
			q=q+1;
		
		}
	}
for(w=6;w<=n;w=w+2)
{
 
		printf("%d=",w);
		for(i=0;i<q;i++)
		{
			r=w-a[i];
			m=sqrt(r)+1;
			p=0;
			for(j=2;j<m;j++)
			{
				if(r%j==0)
				p=p+1;
			}
			if(p==0)
			{
			printf("%d+%d\n",a[i],r);
			break;
			}
		}
	
}
	
}
int f(int i)
{
	int j,s=1;
	if(i%2==0)s=0;
	for(j=3;j<=(int)sqrt(i);j+=2)
	{
		if(i%j==0)s=0;
	}
	return (s);
}
void main()
{
	int n,a,i;
	scanf("%d",&n);
	int f(int i);
	for(a=6;a<=n;a+=2)
	{
		for(i=2;i<=(a/2);i++)
		{
			if(f(i)==1 && f(a-i)==1)
			{
				printf("%d=%d+%d\n",a,i,(a-i));break;
			}
		}
	}
}
int judge(int m)
{
	int i;
	if(m >= 4)
	{
     	for(i = 2; i <= sqrt(m); i++)
		{
	     	if(m % i == 0)
			{
	        	return 0;
		    	break;
			}
		}
    	if(i > sqrt(m))
		{
    		return 1;
		}
	}
	if(m == 3)
	{
		return 1;
	}
}
int main()
{
	int i, j, n;
	cin >> n;
	for(i = 6; i <= n; i = i + 2)
	{
		for(j = 3; j <= i / 2; j++)
		{
			if(judge(j) == 1 && judge(i - j) == 1)
			{
				cout << i << "=" << j << "+" << i - j << endl;
				break;
			}
		}
	}
	return 0;
}
int num_f (int x);
int main ()
{
	int num, a, b, t;
	scanf ("%d", &num);
	for (t=6; t<=num; )
	{
		for (a=3; a<=t/2; )
			{
				b = t - a;
				if (num_f(a)==1&&num_f(b)==1)
				{
					printf ("%d=%d+%d\n", t, a, b);
					t+=2;
					break;
				}
				else a+=2;
			}
		
	}
	return 0;
}

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

int check(int n)
{
 int k,i;
 k=sqrt(n);
 for(i=2;i<=k;i++) 
  {
  	if(n%i==0)
  	{
  	 return(-1);
  	 break;
  	}
  }
 if(i==(k+1))
 return(1);
}
int main() 
 {
 	int i,j,n,k,x,y;
 	int a[50001];
	cin>>n;
 	for(i=1;i<=n;i=i+2) 
 	{
	 	a[i]=1;
	 }
	 for(i=9;i<=n;i=i+2)
 	 {
 	 	for(j=3;j<=sqrt(i);j=j+2)
 	 	{
	 	 	if (i%j==0) 
			  {
  				 a[i]=0;break;
  			  } 
	 	 }
 	 }
 	for(j=6;j<=n;j=j+2)
 	{
	 	
	 for(i=3;i<=(j/2);i=i+2)
 	{
	 	if ((a[i]==1)&&(a[j-i]==1))
	 	{cout<<j<<"="<<i<<"+"<<(j-i)<<endl;break;}
	 }
 	}
 
return 0;
}
int main()
{
	int prime(int a);
	int i,n,a;
	scanf("%d",&i);
	n=6;
	while(n<=i)
	{
	a=3;
	while(a<=n/2)
	{
		if(prime(a)==0&&prime(n-a)==0)
		{
		printf("%d=%d+%d\n",n,a,n-a);
	    break;
		}
	    else
		a+=2;
	}
	n+=2;
	}
    return 0;
}	
int prime(int a)
	{
		int b,c;
		b=0;
		for(c=2;c<=sqrt(a);c++)
		{
			if (a%c==0)
			{
				b=1;break;
			}
		}
		return(b);
	}
int isodd(int num)
{
    int i,flag=1;
    if (num%2==0)
    flag=0;
    else
    {
        if (num==3||num==5||num==7)
        flag=1;
        else
        {
          for (i=3;i<=sqrt(num);i=i+2)
          {
            if (num%i==0)
            {
            flag=0;
            break;
            }
          }
        }
    }
    return flag;
}
int main()
{
    int n,i,temp1,temp2;
    scanf("%d",&n);
    for (i=6;i<=n;i=i+2)
    {
        for(temp1=3;temp1<=n/2;temp1=temp1+2)
        {
            if(isodd(temp1))
            {
                temp2=i-temp1;
                if (isodd(temp2))
                {
                    printf("%d=%d+%d\n",i,temp1,temp2);
                    break;
                }
            }
        }
    }
    return 0;
}
int sushu(int a)
{
	int i;
	int j=0;
	for(i=2;i<=sqrt(a);i++)
	{
		if(a==2)
		{
			break;
		}
		else
		{
			if(a%i==0)
			{
				j=1;
				return(1);
				break;
			}
		}
	}
	if(j==0)
		return(0);
}


int main()
{
	int n;
	scanf("%d",&n);
	int a;
	int x;
	int y;
	for(a=6;a<=n;a++)
	{
		if(a%2==0)
		{
			for(x=3;x<=a/2;x++)
			{
				y=a-x;
				if(sushu(x)==0&&sushu(y)==0)
				{	
					printf("%d=%d+%d\n",a,x,y);
					break;
				}
			}
		}
	}
	return 0;
}
void main()
{
	int n,i,j,k,t,h,a,b,c,d,e,f,g;
	b=1;g=1;
	scanf("%d",&n);
	for(i=6;i<=n;i++)
	{
	if (i%2==0)
	{
		printf("%d=",i);
		k=i/2;
		for(j=3;j<=k;j++)
		{
			b=1;g=1;
			if(j%2==0)continue;
			h=sqrt(j);
			for(t=2;t<=h;t++)
			{
				a=j%t;
				
				if(a==0)
				{
					b=0;
					break;
				}
			}
			
		    if(b==1)
	    	{
	    		c=i-j;
	    		d=sqrt(c);
	    		for(e=2;e<=d;e++)
	    		{
	    			if(e%2==0)continue;
	    			f=c%e;
	    			
	    			if(f==0)
	    			{
	    				g=0;
	    				break;
	    			}
	    		}
	    		if(g==1)
	    		{
	    		printf("%d+%d\n",j,c);
 		        break;
	    		}
	    	}
		}
	}
	}}
int main()
{
	//?????????
	int ss[50000]={0};
	int i,d,j,k=1;
	ss[0]=2;
	for(i=3;i<50000;i=i+2)
	{
		d=0;
		for(j=2;j<=sqrt(i);j++)
		{
			if(i%j==0){d=1;break;}
		}
		if(d==0){ss[k]=i;k++;}		//k++???	
	}
	
	
	
	
	//??
	int sushu(int x);
	int n,a,b;
	int t;
	scanf("%d",&n);
	for(a=6;a<=n;a=a+2)
	{
		t=0;
		for(i=0;i<=a/2;i++)
		{
			b=a-ss[i];
			if(sushu(b))
			{
				printf("%d=%d+%d\n",a,ss[i],b);
				break;
			}
			
			
		}
		
	}
	
	return 0;
	
	
}
int sushu(int x)
{
	
	
	int d=0;
	int j;
	
	for(j=2;j<=sqrt(x);j++)
	{
		if(x%j==0){d=1;break;}
	}
	if(d==0){return 1;}
	else return 0;//k++???	
		
}
int isprime(int n);
void Goldbach(int m);
int main()
{
int m;
scanf("%d",&m);
Goldbach(m);
return 0;
}

int isprime(int n)
{
	int i,j;
	if(n==2)
	{
		return 1;
	}
	else if(n==1)
	{
		return 0;
	}
	else
	{
		for(i=2,j=0;i<=(int)sqrt(n);i++)
		{
			if(n%i==0)
			{
				break;
			}
			else
			{
				j++;
			}
		}
		if(j!=(int)sqrt(n)-1)
		{
			return 0;
		}
		else
		{
			return 1;
		}
	}
}

void Goldbach(int m)
{
	int i,j;
	for(i=6;i<=m;i++)
	{
		if(i%2==0)
		{
			for(j=3;j<=i;j++)
			{
				if((isprime(j)==1)&&(isprime(i-j)==1))
				{
					printf("%d=%d+%d\n",i,j,i-j);
					break;
				}
			}
		}
	}
}
int p(int m);
int main()
{
	int n,i=5;
	cin>>n;
for(i=6;i<=n;i=i+2)
{
		int a=0,b=0;
		for(a=2;a<=i-2;a++)
		{	
				if(p(i-a)&&p(a))
				{	cout<<i<<"="<<a<<"+"<<i-a<<endl;
			     break;
				}
		
		}

	}
	return 0;
}

  





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

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

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

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


  return 0;
}
int main()
{
	int i=0,num=0,n=0,t1=0,t2=0,shu=0;
	cin>>n;
	for(shu=6;shu<=n;shu=shu+2)
	{
		for(num=3;num<=shu/2;num=num+2)
		{
			t1=0;
			for(i=2;i<=sqrt(num);i++)
			{
				if(num%i==0)
				{
					t1=1;
					break;
				}
				else
					continue;
			}
			if(t1==1)
				continue;
			else
			{
				t2=0;
				for(i=2;i<=sqrt(shu-num);i++)
				{
					if((shu-num)%i==0)
					{
						t2=1;
						break;
					}
					else
						continue;
				}
			}
			if(t2==1)
				continue;
			else 
				cout<<shu<<"="<<num<<"+"<<shu-num<<endl;
			break;
		}
	}
	return 0;
}
int main()
{
	int n, i=6, j=3, a=2, b, m=0, x=0, y=2;
	scanf("%d", &n);
    for(i=6; i<=n; i++){
		if(i%2==0){
			for(j=3; j<=i/2; j++){
				m = 0;
				for(a=2; a<=(int)sqrt(j); a++){
					if(j%a==0){
						m = 1;
						a = 2*i;
					}
				}
               if(m==0){
				b = i - j;
				x = 0;
				for(y=2; y<=(int)sqrt(b); y++){
					if(b%y==0){
						x = 1;
					    y = 2 * b;
					}
				}
				if(x==0){
					printf("%d=%d+%d\n", i, j, b);
						j = 2 * i;
				}
			   }
			}
		}
	}
	return 0;
}
int main( )
{
   int a[50000],i,j,n,k,t=2,m,c[50000]={0},p;
   scanf("%d",&n);
   a[0]=2;
   a[1]=3;
   c[2]=1;
   c[3]=1;
   for (i=5;i<n;i=i+2)
    {
      for (j=0;a[j]<=sqrt(i);j++)
       {
         if (i%a[j]==0)
           break;
       }
      if (a[j]>sqrt(i))
        {
          a[t]=i;
          c[a[t]]=1;
          t++;
        }
     }
   for (i=6;i<=n;i=i+2)
    {
      for (j=0;a[j]<=i/2;j++)
          {
            p=i-a[j];
            if (c[p]==1)
              {
                printf("%d=%d+%d\n",i,a[j],i-a[j]);
                break;
              }
          }
     }
   return 0;
}
int main()
{
  int f(int n);
  int n,i,j;
  scanf("%d",&n);
  for(i=6;i<=n;i+=2)
  {
    for(j=3;j<i;j++)
	{
	  if(f(j)==1&&f(i-j)==1)
	  {
	  printf("%d=%d+%d\n",i,j,i-j);
	  break;
	  }
	}
  }
return 0;
}
int f(int n)
{
  int i,a=sqrt(n),c;
  for(i=2;i<=a;i++)
  
    if(n%i==0) break;
	if(i>a) c=1;
    else c=0;
  return(c);
}
int isprime (int a)
{
	int i;
	if(a==2)
		return 1;
	if((a!=2)&&(a%2==0))
		return 0;
	
	for(i=3;i<(int)sqrt(a)+1;i=i+2)
	{
		if(a%i==0)
			return 0;
	}

	return 1;
}

int main()
{
	int n,i;
    int k;
	
    scanf("%d",&n);
    for(k=6;k<=n;k=k+2)
	{
		for(i=3;i<k;i++)
		{
			if((isprime(i)==1)&&(isprime(k-i)==1))
			{
				printf("%d=%d+%d\n",k,i,k-i);
				break;
			}
		}
	}
		
return 0;
}
int f(int n)
{
	int i,k;
	k=(int)sqrt(n);
	for(i=2;i<=k;i++)
	{
		if(n%i==0)break;
	}
	if(i>k)return 1;
	else return 0;
}
int main()
{
	int n,i,j;
	scanf("%d",&n);
    for(i=6;i<=n;i+=2)
	{
		for(j=3;j<i;j+=2)
		{
			if(f(j)&&f(i-j))
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
	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 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;
				return isprime;
				break;
			}
		}
	}
	return isprime;
}
int a,b;
int sushu(int a)
{
	int j;
	for(j=3;j<(int)sqrt(a)+2;j=j+2)
		if(a%2==0 || a%j==0)return 0;
	return 1;
}
int fenjie(int i)
{
	for(a=2;a<i;a++)
		if(sushu(a)&&sushu(i-a))
			return a;
}

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

	return 0;
}
void main()
{
 int x,i,j,m,f,k;
 
 
 scanf("%d",&x);
 for(k=6;k<=x;k=k+2)
 {
 if((k%2==0)&&(x>=6))
 {
  for(i=3;i<=k/2;i+=2)
  {
   f=1;
   for(j=2;j<=sqrt(i);j++)
   {
    if(i%j==0)
    {
     f=0;
     break;
    }
   }
   if(f==1)
    m=k-i;
   for(j=2;j<=sqrt(m);j++)
    { 
        if(m%j==0)
     {
      f=0;
      break;
     }
    }
    if(f==1)
    {
     printf("%d=%d+%d\n",k,i,m);
     break;
    }
  }
  }
 }
 
 getchar();
}
void main()
{
	int n,i,j,k,r,m,s,p;
	scanf("%d",&n);
	for(p=6;p<=n;p=p+2)
	{for(j=2;j<=p;j++)
	{
	 k=sqrt(j); 
	 i=2;
	 if(j%i==1)
	 {for(i=3;i<=k;i=i+2)
	 {if(j%i==0) break;}}
	 if(i>=k+1)
	 {m=p-j;
	  s=sqrt(m);
	  r=2;
	  if(m%r==1)
	  {
	   for(r=3;r<=s;r=r+2)
	   {if(m%r==0) break;}
	  }
	  if(r>=s+1) break;}}
	 printf("%d=%d+%d\n",p,j,m);}
	  
}
int prime (int x)
{
	int i,p=1;
	for (i=2;i<=sqrt(x);i++)
	{
		if (x%i==0)
		{
			p=0;break;
		}
	}
	return p;
}
int main ()
{
	int n;
	scanf ("%d",&n);
	int i=6;
	while (i<=n)
	{
		int j=3;
		while (j<=i/2)
		{
			if (prime(j))
			if (prime(i-j))
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
			j++;
		}
		i+=2;
	}
	return 0;
}
void main()
{
  int n,i,j,k,pan,x1,x2;
  scanf("%d",&n);
  for(i=6;i<=n;i+=2)
  {
	  for(j=3;j<=i;j+=2)
	  {
		  pan=sqrt(j);
		  for(k=3;k<=pan;k+=2)
			  if(j%k==0)break;
		  if(k>=pan+1)
		  {
              x2=i-j;
	          pan=sqrt(x2);
	          for(k=3;k<=pan;k+=2)
		         if(x2%k==0)break;
	          if(k>=pan+1)break;
		  }
	  }
    printf("%d=%d+%d\n",i,j,x2);
  }
}
int main()
{
	int n, a[25000], m = 4, j, q;
	double k;
	a[2] = 3;
	a[3] = 5;
	a[4] = 7;
	cin >> n;
	for (int i = 11; i <= n / 2; i = i + 2)
	{
		k = sqrt(1.0 * i);
		for (j = 2; (a[j] <= k && j <= m); j ++)
			if (i % a[j] == 0)
				break;
		if ( a[j] > k || j > m)
		{
			m ++;
			a[m] = i;
		}
	}
	for (int i = 6; i <= n; i = i + 2)
		for ( int p = 2; a[p] <= i / 2; p ++)
		{
			k = sqrt(1.0 * (i - a[p]));
			for (q = 3; q <= k; q = q + 2)
				if ((i - a[p]) % q == 0)
					break;
			if (q > k)
			{
				cout << i << '=' << a[p] << '+' << i - a[p] << endl;
				break;
			}
		}
	return 0;
}
int main()
{
	int n,i,j,k,x,y,z,a;
	scanf("%d",&n);
	x=n/2;
	for (i=6;i<=n;i+=2)
	{
		for (j=3;j<=x;j++)
		{
			if (j%2==0)
				goto me;
			if (j>2&&j%2!=0)
			{
				y=sqrt(j);
					for (k=3;k<=y;k+=2)
						if (j%k==0)
							goto me;
			}
			a=i-j;
			z=sqrt(a);
			if (a%2==0)
				goto me;
			else
			{
				for (k=3;k<=z;k+=2)
					if (a%k==0)
						goto me;
			}
			printf("%d=%d+%d\n",i,j,a);
			break;
		me:;
		}
	}
return 0;
}
void main()
{
	unsigned int n,k=6,i=3,j=3,a,b,x,y;
	scanf("%d",&n);
	x=sqrt(i);
	y=sqrt(j);
	while(k<=n)
	{for(a=3;a<=sqrt(i);a+=2)
	if(i%a==0)break;
	j=k-i;
	for(b=3;b<=sqrt(j);b+=2)
	if(j%b==0)break;
	if(a>sqrt(i)&&b>sqrt(j)){printf("%d=%d+%d\n",k,i,j);k+=2;i=3;}
	else {i+=2;}
	}
	
}
int f(int k);
void main()
{
	int x,i,n;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{
		for(x=3;x<i/2;x=x+2)
		{
			if(f(x)==0) continue;
			else if(f(i-x)==0) continue;
			else break;
		}
			printf("%d=%d+%d\n",i,x,i-x);
	}
}

int f(int k)
{
	int t;
	for(t=3;t<=sqrt(k);t++)
	{
		if(k%t==0) 
		break;
	}
	if(t<=sqrt(k)) return 0;
	else return 1;
	
}
int sushu(int x)
{
	int i,r=1;
	if(x%2==0)r=0;
	for(i=3;i<=sqrt(x);i=i+2)
	{
        if(x%i==0)r=0;
	}
		return r;
}
int main(int argc, char* argv[])
{
	int n,fig,elm1,elm2;
	scanf("%d",&n);
    for(fig=6;fig<=n;fig=fig+2)
	{
		for(elm1=2;elm1<fig;elm1++)
		{
			elm2=fig-elm1;
			if(sushu(elm1)==1&&sushu(elm2)==1)
			{
                printf("%d=%d+%d\n",fig,elm1,elm2);
				break;
			}
		}
	}
	return 0;
}
int main ()
{
	int n , p , q , i , j , k , l, s , g ,h ;
	cin>> n ;
	for ( i = 6 ; i <= n ; i = i + 2)
	{
		g = 0;
		for ( j = 3 ; j <= i / 2 ; j = j + 2 )
		{
			p = sqrt( j );
			g = 0 ;
				 for ( k = 1 ; k <= p ; k++ )
				 {
			         if ( ( k != 1 ) && ( ( j % k ) == 0 ) )
					 {
				      g = 1;
				      break;
					 }
				 }
				
		   if ( g == 0 )
		   {
			 s = i - j; 
		     q = sqrt( s );
		     h = 0;
		       for ( l = 1 ; l <= q ; l++ )
			   {
			      if ( ( l != 1 ) && ( ( s % l ) == 0 ) )
				  {
				   h = 1;
				   break;
				  }
			   }
		       if( h == 0)
			   {
			    cout<<i<<"="<<j<<"+"<<s<<endl;
			    break;
			   }
		   }
		}
		
	}
	return 0 ;
}
int ip(int x){
	int i;
	for(i=2;i*i<=x;i++){
		if(x%i==0){
			return 0;}
	}
	return 1;
}
int main(){
	int a,i,j,t,e,n;

	scanf("%d",&n);

	
	
	for(i=6;i<=n;i+=2){
		
		for(j=3;j<=i/2;j+=2){
			if(ip(j)&&ip(i-j)){
				printf("%d=%d+%d\n",i,j,i-j);
			j=i;
			}
		}
		
	}
	
	return 0;
}
int main()
{
    int n;
    cin>>n;
    int i,j,k,t;
	int m,s;
	for(i=6;i<=n;i=i+2)
	{
		  for(k=2;k<=i;k++)
		  {
			    m = (int) sqrt(k);				
		        
				for (j=2 ; j<=m ; j++)			
				{
			          if( k%j == 0 )				   
			          break;
				}
		        if(j==m+1)				//??k???
				{
                      s = (int) sqrt(i-k);
					  for(t=2;t<=s;t++)
					  {
						    if((i-k)%t==0)
							break;
					  }
					  if(t==s+1)		//??n-k????
					  {
						  cout<<i<<"="<<k<<"+"<<i-k<<endl;
						  goto end;
					  }

				}
		  }
          end:;
	}


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

int prime(int x)
{
	int t=1,i;
	if (x%2==0)
		t=0;
	i=3;
	while (i*i<x+1)
	{
		if (x%i==0)
		{
			t=0;
			break;
		}
		i+=2;
	}
	return t;
}
int main ()
{
	int n, i, j, k, f;
	cin >> n;
	for (i = 6; i <= n; i += 2)
	{
		f = 0;
		for (j = 3; j + j <= i; j += 2)
		{
			for(k = 3; k * k <= j; k += 2)
			{
				if (j % k == 0)
					break;
			}
			if ( k * k > j)
			{
				for(k = 3; k * k <= i - j; k += 2)
				{
					if ((i - j) % k == 0)
						break;
				}
				if (k * k > i - j)
				{
					cout << i << '=' << j << '+' << i - j << endl;
					f = 1;
				}
			}
			if (f == 1)
				break;
		}

	}
	return 0;
}