semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
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;
}
main()
{
	long n,i,a,b,c,d;
	scanf("%ld",&n);
	for(i=6;i<=n;i=i+2)
	{
		for(a=3;a<=i;a+=2)
		{
			b=3;
			for(;b<=sqrt(a);b+=2)
			if(a%b==0) break;
			if(b>sqrt(a))
			{
				c=i-a;
				d=3;
				for(;d<=sqrt(c);d+=2)
					if(c%d==0) break;
					if(d>sqrt(c)) {printf("%ld=%ld+%ld\n",i,a,c);break;}
			}
		}
	
	}
}
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;
}
int main()
{
	int n,i,t,a[80000]={0},sum=0;
	cin>>n;
		for(i=2;i<sqrt(n);i++,sum=0)
		{
			sum=sum+i;
			if(a[sum]==0)
			{
				while(sum<=n)
				{
					sum=sum+i;
					a[sum]=1;
				}
			}
		}
		t=n-6;
		for(i=2;i<=n/2&&t>=0;i++)
		{
			if(a[i]==1)
				continue;
				if(a[n-i-t]==0)
				{
					cout<<n-t<<'='<<i<<"+"<<n-i-t<<endl;
					t=t-2;
					i=1;
				}
		}
	return 0;
}
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 R(int *p,int n)
{
     int i,m=0;
     if(p[n]==0)
     {
             for(i=2;i<=(int)sqrt(n);i++)
             if(n%i==0) m++;
             if(m==0) p[n]=1;
             else p[n]=2;
     }
     if(p[n]==1) return 1;
     else if(p[n]==2) return 2;
}
void Find(int *p,int n)
{
     int i;
     if(R(p,n-2)==1) printf("%d=%d+%d\n",n,2,n-2); 
     else
     {
         for(i=3;i<=n/2;i+=2)
         if(R(p,i)==1&&R(p,n-i)==1) break;
         if(R(p,i)==1&&R(p,n-i)==1) printf("%d=%d+%d\n",n,i,n-i);
     } 
}
main()
{
      int n,m;
      int *p;
      scanf("%d",&m);
      p=(int*)malloc((m)*sizeof(int));
      memset(p,0,sizeof(p));
      p[2]=1;
      for(n=6;n<=m;n+=2)
      Find(p,n);
      free(p);
}
//******************************************************************
//*??????????                                            *
//*????????n?n <= 50000???                             *
//       ?6 ~ n?????????????????                 *
//*??????                                                    *
//*???2010?10?20?                                            *
//******************************************************************
int main()
{
	int n, x, i;
	cin >> n;
	int godbah(int);                       //?godbah??????
	for (i = 6; i <= n; i = i + 2)         //??????????
	{
		x = godbah(i);
		cout << i << '=' << x << '+' << i - x << endl;
	}
	
	return 0;
}
int prime(int n)                           //??????prime???????????
{
	int i, p = 1, k = (int) sqrt(n);
	for (i = 2; i <= k; i ++)              //for????
	{
		if (n % i == 0)                    //?????????????p??0
		{
			p = 0;
			break;
		}
	}
	return p;                             //??p?
}
int godbah(int n)                         //??godbah?????????????????
{
	int a, q;
	for (a = 3; a <= n / 2; a = a + 2)
	{
		if (prime(a) == 1 && prime(n - a) == 1)//?????????????????????
		{
			q = a;
			break;
		}
	}
	return q;
}
int main()
{
 int i,j,n;
 int c1=1,c2=1;
 int k,b;
 scanf("%d",&n);
 n=n/2*2;
 for(i=6;i<=n;i+=2)
 {
  for(j=3;j<=i/2;j+=2)
  { 
   c1=1;c2=1;
   b=sqrt(j);
   for(k=3;k<=b;k+=2)
   if(j%k==0)c1=0;
   b=sqrt(i-j);
   for(k=3;k<=b;k+=2)
   if((i-j)%k==0)c2=0;    
  if(c1&&c2)
   {
    printf("%d=%d+%d\n",i,j,i-j);
    break;
   }
}
 }
}
void main() 
{ 
int i,n,j,k,m,l=0,yinru; 
scanf("%d",&yinru);
for(i=6;i<=yinru;i+=2) 
{ 
for(n=2;n<i;n++) 
{ 
for(j=2,k=1;j<=(int)sqrt(n);j++)
{ 
if(n%j==0) k=0; 

} 
if(k) 
for(j=2,m=1;j<=(int)sqrt(i-n);j++)
{ 
if((i-n)%j==0) m=0; 

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

break; 
}
} 

} 

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

	}
}
int main()
{
	int a,s;
    scanf("%d",&a);
    for(s=6;s<=a;s=s+2)
	{ int i1,i2;
	for(i1=3;i1<=s;i1=i1+2)
	{i2=s-i1;
	int t,p,a,b;
	t=(int)sqrt(i1);
	p=(int)sqrt(i2);
	for(a=2;a<=t;a++)
	{if(i1%a==0) break;}
	for(b=2;b<=p;b++)
	{if(i2%b==0) break;}
	if(a>t&&b>p)
	{printf("%d=%d+%d\n",s,i1,i2); 
	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;
			}
		}
	 }
}
void main()
{
	long m,n,i,j,k,x,t=1;
	scanf("%ld",&n);
	for(m=6;m<=n;m=m+2)
	{
		for(i=2;i<=m/2;i++)
		{
		
			k=sqrt(i);
			for(j=2;j<=k;j++)
				if(i%j==0) break;
			if(j>=k+1)
			{
				x=m-i;
				
				k=sqrt(x);
				for(j=2;j<=k;j++)
					if(x%j==0) break;
				if(j>=k+1)
				{
					printf("%ld=%ld+%ld\n",m,i,x);
					break;
				}
			}
		}
	}
}
int main()
{
    int i,j,k;
    int n;
    int p=0,q=0;

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

       for(j=3;j<=i/2;j=j+2)
       {
           p=0;
        q=0;
       for(k=2;k<sqrt(j)+1;k++)
           {
               if(j%k==0)
               {
                  p=1;
                  //printf("aaa%d%d",j,k);
                  break;
                }

           }
           if(p!=1)
           {
              for(k=2;k<sqrt(i-j)+1;k++)
              {
               if((i-j)%k==0)
               {
                  q=1;
                  break;
               }
               }
           }
           if(p+q==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=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 main()
{
	int n , i , k1 , k2 , r1 , r2 , m , a , b;
	cin >> n;
	for (i = 6; i <= n; i = i + 2)
	{
		for (m = 3; m <= i / 2; m = m + 2)
		{
			k1 =(int) sqrt((double)m);   
			for (r1 = 2; r1 <= k1; r1 ++)    
			{
				if (m % r1 == 0)      
					break;
			}
			if (r1 == k1 + 1)
			{
				a = m;
				b = i - m;
				k2 =(int) sqrt((double)b);   
				for (r2 = 2; r2 <= k2; r2 ++)    
				{
					if (b % r2 == 0)      
						break;
				}
				if (r2 == k2 + 1)
				{
					cout << i << "=" << a << "+" << b << endl;
					break;
				}
			}
		}
	}
	return 0;
}
void main()
{
	int n,i,m,q,j,k,l,r;
	scanf("%d",&n);
	i=6;
	while (i<=n) 
	{
		m=3;
		q=1;
		while ((m<=(i/2))&&(q==1))
		 {
			j=2;
            k=1;
		    while ((j<=sqrt(m))&&(k==1))
			 {
			    if (m%j==0) k=0;
			    j++;
			 }
		    if (k==1) 
			 {
				l=i-m;
				j=2;
                r=1;
		        while ((j<=sqrt(l))&&(r==1))
				 {
			        if (l%j==0) r=0;
			        j++;
				 }
				if (r==1) 
				 {
					q=0;
					printf("%d=%d+%d\n",i,m,l);
				 }
			 }
			m++;
		 }
		i=i+2;
	}
}
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 a(float b){
	int i;
	int c=1;
	int d;
	d=sqrt(b);
	if(b==3.0||b==5.0||b==7.0){
		return 1;
	}
	else{
		for(i=3;i<=d;i+=2){
			if((int)(b)%i==0){
				c=0;
				return 0;
				break;
			}
		}
	}
	return c;
}
int main()
{
	int n,k,l;
	scanf("%d",&n);
	for(l=6;l<=n;l+=2){
		for(k=3;k<=(n/2);k+=2){
			if(a(k)+a(l-k)==2){
				printf("%d=%d+%d\n",l,k,l-k);
				break;
			}
		}
	}
	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;
}
void main()
{
	int a,i,j,x1=1,n;
	scanf("%d",&n);
	for (a=6;a<=n;a=a+2)
	for(i=2;i<=a;i++)
		if ((i==2)||(i%2==1))
		{
			x1=1;
				for(j=2;j<=sqrt(i-1)+1;j++)
				if (i%j==0) {x1=0;break;}
				if (x1)
					for(j=2;j<sqrt(a-i)+1;j++)
				if ((a-i)%j==0) {x1=0;break;}
				if(x1){printf("%d=%d+%d\n",a,i,a-i);break;}
		}
}
int main()
{
	int i,j,n,a,b,c,k,p,q,m;
	scanf("%d",&n);
		for(a=6;a<=n;a=a+2)
		{
			for(i=3;i<=a/2;i=i+2)
			{
				k=sqrt(i);
				for(j=2;j<=k;j++)
				{
					if(i%j==0)break;
				}
				if(j>=k+1)
				{
					b=i;
				    c=a-b;
					p=sqrt(c);
					for(m=3;m<=p;m=m+2)
					{
						if(c%m==0)break;
					}
					if(m>=p+1)
					{
						q=c; 
						printf("%d=%d+%d\n",a,b,q);
						break;
					}
				}
			}
		
			
			
		}
					
		
	return 0;
}
int main(){
	long int n;
	scanf("%d",&n);
	long int k,a,b,c,d,e=1,f,g[100000]={2,3},h;
	for(k=3;k<=n;k+=2){
		c=(int)sqrt(k);
		for(b=3;b<=c;b++)
		    if(k%b==0) goto b;
		e++;
		g[e]=k;
b:;}
 for(d=6;d<=n;d+=2){
		for(f=1;f<=e;f++){
			for(h=e;h>=0;h--){
				if(d==g[f]+g[h]){printf("%d=%d+%d\n",d,g[f],g[h]);goto a;}
			if(d>n)break;}
		}
a:;	}
		
	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 main()
{
   int n,a,b,m,k,l,i,j,c;
   scanf("%d",&n);
   for(a=6;a<=n;a+=2)
   {
     b=a/2;
	 c=0;
     for(m=3;m<=b;m+=2)
	 {
	   k=sqrt(m);
	   for(i=2;i<=k;i++)
	      if(m%i==0)
		  break;
	   if(i>=k+1)
	   {
	     l=sqrt(a-m);
         for(j=2;j<=l;j++)
	      if((a-m)%j==0)
		  break;
		  if(j>=l+1)
		  {
		  printf("%d=%d+%d",a,m,a-m);
		  printf("\n");
		  c=1;
		  }
		  else
			  c=0;
	   }
	   if(c==1)
		   break;
	  }
	}
	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);
}
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;
}
int main()
{
    int n;
    int i,j,k;
    int x;
    int p,q;
    scanf("%d",&n);
    for(i=6;i<=n;i=i+2)
    {
        for(j=3;j<=i/2;j=j+2)
        {
            p=0;
            for(k=2;k<sqrt(j)+1;k++)
            {
                if(j%k==0)
                {
                    p=1;
                    break;
                }
            }
            if(p==0)
            {
               q=0;
               for(k=2;k<sqrt(i-j)+1;k++)
               {
                  if((i-j)%k==0)
                  {
                    q=1;
                    break;
                  }
               }
               if(q==0)
               {
                   printf("%d=%d+%d\n",i,j,i-j);
                   break;
               }
            }
        }
    }
    return 0;
}
void main() 
{ 
int i,x,j,k,n,m,l=0; 
scanf("%d",&n);
for(i=6;i<=n;i+=2) 
{ 
for(x=2;x<i;x++) 
{ 
for(j=2,k=1;j<=(int)sqrt(x);j++)
{ 
if(x%j==0) k=0; 

} 
if(k) 
for(j=2,m=1;j<=(int)sqrt(i-x);j++)
{ 
if((i-x)%j==0) m=0; 

} 
if(m) 
{ 
printf("%d=%d+%d\n",i,x,i-x);
l++;
break; 
}
} 
if(x==i) printf("error %d\n",i);
} 

}
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 ss(int x)   /*???????*/
{
  int k,y,z;
  k=(int)sqrt(x);

  for(y=3;y<=k;y=y+2)
  if(x%y==0)break;
  if(y>k)z=1;else z=0;
  return(z) ;
}

void main()
{
  int n,i;   /* i????????n???  */
  int p,m;   /*p?????????m=n-p*/
  scanf("%d",&n);
  for(i=6;i<=n;i+=2)
  {
  p=3;
     while(p<i-2)
	 {
       if(ss(p))
	   {
	   m=i-p;
	   if(ss(m)) {printf("%d=%d+%d\n",i,p,m);break;}
	   else p+=2;
	   }else p+=2;
	 }

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

	return 0;
}
main()
{
      long int n,k,i,j,t,s;
      scanf("%ld",&n);
      for(k=6;k<=n;k++)
      {
         if(k%2==0)
         {
             for(i=3;i<k;i++)
             {
                 t=1;
                 if(i%2==0)t=0;
                 else
                 for(j=3;j<=sqrt(i);j=j+2)
                 {if(i%j==0){t=0;break;}
                 }
                 if(t)
                 {   
                      s=k-i;
                      if(s%2==0)t=0;
                      else
                      for(j=3;j<=sqrt(s);j=j+2)
                      {if(s%j==0){t=0;break;}
                      }
                 if(t){printf("%ld=%ld+%ld\n",k,i,s);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;
}
void main()
{
	int n,i,j,a,b,m,k,l;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{
		m=0;
		k=0;
		printf("%d=",i);
		for(a=3;a<=i/2;a=a+2)
		{
			m=0;
			k=0;
			b=i-a;
			for(l=3;l<=sqrt(a);l=l+2)
			{
				if(a%l!=0)
				{m=m+1;}
				k=k+1;
			}
			if (m==k)
			{
		
				m=0;
				k=0;
				for(j=3;j<=sqrt(b);j=j+2)
				{
					if(b%j!=0)
				    m=m+1;
				    k=k+1;
				}
				if(m==k)
				{
					printf("%d+%d\n",a,b);
					break;
				}
			}
		}
	}
}