semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
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 i,j,n,k,h;
    cin>>n;//????6<=n<=50000
    for(i=6;i<=n;i+=2){
        for(j=3;j<=i/2;j+=2){
            for(k=2;k<=sqrt(j);++k)
                if(j%k==0)
                    break;
            for(h=2;h<=sqrt(i-j);++h)
                if((i-j)%h==0)
                    break;
            if(h>sqrt(i-j)&&k>sqrt(j)){
                cout<<i<<"="<<j<<"+"<<i-j<<endl;
                break;
            }
        }
    }
}
int main() 
{
	int p, n, a, b, i, m, t, k; 
	cin >> p;
	for(n=6;n<=p;n=n+2)
	{
		for(i=2;i<=(n/2);i=i+1) 
		{	
			a = sqrt(i);
			for(t=3;t<=a;t=t+2) 
			{
				if(i%t==0) break; 
			}
			if(t>a)
			{
				m = n - i; 
				b = sqrt(m); 
				for(k=2;k<=b;k++) 
				{
					if(m%k==0) break; 
				}
				if(k==b+1) 
				{
					cout << n << "=" << i << "+" << m << endl; 
					break;
				}
			}	
		 }
	}
	return 0; 
}
void main()
{
	int k,x,y,t,m;
	scanf("%d",&t);
	for(m=6;m<=t;m=m+2)
	{
    for(x=3;x<=m/2;x=x+2)
	{
	    for(k=2;k<=sqrt(x)+1;k++)
		{
			if(x%k==0) break;
		}
		if(k>sqrt(x))
		{
            y=m-x;
	        for(k=2;k<=sqrt(y)+1;k++)
			{
				if(y%k==0) break;
			}
		    if(k>sqrt(y)) break;
		
		}
	}
	printf("%d=%d+%d\n",m,x,y);
	}
}
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 main()
{  int k,x,t,q,i,m,n,a[25000];
    double j,p;
    cin>>n;
	for (i=6;i<=n;i=i+2)
	{ p=i;
		k=sqrt(p);
        for (j=3;j<=p;j=j+2)
		{  
			t=sqrt(j) ;
		    q=j;
			for(m=3;m<=t;m=m+2)
			{ if (q%m==0)
			{ break;}
			}
			if (m>t)
			{  t=sqrt(p-j) ;
		    q=p-j;
			for(m=3;m<=t;m=m+2)
			{ if (q%m==0)
			{ break;}
			}
			if (m>t)
			{ cout<<i<<"="<<j<<"+"<<i-j<<endl; 
			break;}}}}
return 0;
}
void main()
{
	int n,m=6,r,x,y;
	scanf("%d",&n);
	while(m<=n)
	{
		r=3;
		while(r<=m/2)
		{
			x=2;
			while(x<=sqrt(r))
			{
				y=r%x;
				if(y!=0) x=x+1;
				else x=r;
			}
			if(x==r)
			r=r+2;
			else
			{
				x=2;
				while(x<=sqrt(m-r))
				{
					y=(m-r)%x;
					if(y!=0) x=x+1;
					else x=m-r;
				}
				if(x==m-r) r=r+2;
				else {printf("%d=%d+%d\n",m,r,m-r);r=m;}
			}
		}
		m=m+2;
	}
}
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 ss(unsigned long int n){
	unsigned long int i , s = 0 ;
	if( n % 2 == 0 ) s = 1 ;
	else if( n % 3 == 0 && n != 3 ) s = 1 ;
	else if( n % 5 == 0 && n != 5 ) s = 1 ;
	else if( n % 7 == 0 && n != 7 ) s = 1 ;
	else if( n % 11 == 0 && n != 11 ) s = 1 ;
	else if( n % 13 == 0 && n != 13 ) s = 1 ;
	else if( n % 17 == 0 && n != 17 ) s = 1 ;
	else if( n % 19 == 0 && n != 19 ) s = 1 ;
	else if( n % 23 == 0 && n != 23 ) s = 1 ;
	else if( n % 29 == 0 && n != 29 ) s = 1 ;
	else if( n % 31 == 0 && n != 31 ) s = 1 ;
	else if( n % 37 == 0 && n != 37 ) s = 1 ;
	else if( n % 41 == 0 && n != 41 ) s = 1 ;
	else if( n % 43 == 0 && n != 43 ) s = 1 ;
	else if( n % 47 == 0 && n != 47 ) s = 1 ;
	else if( n % 53 == 0 && n != 53 ) s = 1 ;
	else if( n % 59 == 0 && n != 59 ) s = 1 ;
	else if( n % 61 == 0 && n != 61 ) s = 1 ;
	else if( n % 67 == 0 && n != 67 ) s = 1 ;
	else if( n % 71 == 0 && n != 71 ) s = 1 ;
	else if( n % 73 == 0 && n != 73 ) s = 1 ;
	else if( n % 79 == 0 && n != 79 ) s = 1 ;
	else if( n % 83 == 0 && n != 83 ) s = 1 ;
	else if( n % 87 == 0 && n != 87 ) s = 1 ;
	else if( n % 89 == 0 && n != 89 ) s = 1 ;
	else if( n % 91 == 0 && n != 91 ) s = 1 ;
	else if( n % 97 == 0 && n != 97 ) s = 1 ;
	else if( n % 101 == 0 && n != 101 ) s = 1 ;
	else if( n % 103 == 0 && n != 103 ) s = 1 ;
	else if( n % 107 == 0 && n != 107 ) s = 1 ;
	else if( n % 109 == 0 && n != 109 ) s = 1 ;
	else for ( i = 47 ; i < n / 109; i = i + 2 ){
		if( n % i == 0 ) s = 1 ;
	}
	return(s);
}

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

	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;
}
void main()
{
	int su(int x);
	int n,a,b,c,d,k;
	scanf("%d",&n);
	for(k=6;k<=n;k=k+2)
	{
	 for(a=2;a<k/2+1;a++)
	 {
		b=k-a;
		c=su(a);
		d=su(b);
		if(c==0&&d==0)break;
	 }
	 printf("%d=%d+%d\n",k,a,b);
	}

}

su(int x)
{
	int i,j=0,z;
	if(x==2)
		z=0;
	else
	{
		for(i=2;i<sqrt(x)+1;i++)
			if(x%i==0)
				j=j+1;
	    if(j==0)
			z=0;
		else
			z=1;
	   
	}
	return(z);
}
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 n, i, j, k, p, q, a, b, c;
	cin >> n;
	for ( k = 6; k <= n; k += 2 )
	{
		a = k / 2;
		for ( p = 3; p <= a; p += 2 )           //??p?????
		{
			b =(int) sqrt ((double) p);
			for ( i = 2; i <= b; i ++ )
			{
				if ( p % i == 0 )	break;
			}
			if ( i == b + 1 )
			{                            //??q?????
				q = k - p;             
				c = (int) sqrt((double) q);
				for ( j = 2; j <= c; j ++)
				{
					if ( q % j == 0) break;
				}
				if ( j == c + 1 )
				{	
					cout << k << "="  << p << "+" << q <<endl;	break;
				}
			}
		}
	}
	return 0;
}
int main()
{
	long n,m,i,j,l,k=0,p[10000]={2};
	scanf("%ld",&n);
	for(i=3;i<n;i+=2)
	{
		m=(int)sqrt(i);
		for(j=0;j<=k&&p[j]<=m;j++)
			if(i%p[j]==0)
				goto a;
		p[++k]=i;
		a:;
	}
	for(i=6;i<=n;i+=2)
	{
		for(j=1;j<=k;j++)
			for(l=k;l>=j;l--)
			{
				if(i==p[j]+p[l])
				{
					printf("%ld=%ld+%ld\n",i,p[j],p[l]);
					goto b;
				}
				else if(i>p[j]+p[l])break;
			}
		b:;
	}
	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 main(){
	int n,i,j,k,l;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2){    //i??
		for(j=3;j<=(int)i/2;j=j+2){   
				int num=0;   //j?????
			    for(k=1;k<=(int)sqrt(j);k=k+2){
				   if(j%k==0)
					   num++;
				}
				int num2=0;
				for(l=1;l<=(int)sqrt(i-j);l=l+2){//i-j???????
				   if((i-j)%l==0)
					   num2++;
				}
				if(num==1&&num2==1){
					printf("%d=%d+%d\n",i,j,(i-j));
					break;}
			}
		}
		return 0;
	}
int main()
{
    int n, i;
    cin >> n;
    for ( i = 6; i <= n; i = i + 2)
    {
        int a, b, m = 0;
        for ( a = 3; a <= i / 2; a = a + 2)
        {
            int s, k = 0;
            for (s = 3; s <= sqrt(a); s = s + 2)
            {
                if ( a % s == 0)
                {
                     k = 1;
                     break;
                }
            }
            if ( k == 0 )
            {
                 b = i - a;
                 int j, t = 0;
                 for (j = 3; j <= sqrt(b); j = j + 2)
                 {
                     if ( b % j == 0)
                     {
                          t = 1;
                          break;
                     }
                 }
                 if ( t == 0 )
                 {
                      cout << i << "=" << a << "+" << b <<endl;
                      m = 1;
                 }
            }
            if ( m == 1)
               break;
        }
    }
    return 0;
}
void main()
{

	int n,i,j,k,a,b;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{
		for(j=3;j<=i;j=j+2)
		{
			a=0;
			b=0;
			for(k=3;k<=sqrt(j);k=k+2)
				if(j%k==0)
				{
					a=1;
					break;
				}
			for(k=3;k<=sqrt(i-j);k=k+2)
				if((i-j)%k==0)
				{
					b=1;
					break;
				}
			if(a==0&&b==0)
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
		
	}
}
int sushu(int a)
{int z,k;
if(a==2)
z=1;
for(k=2;k<=sqrt(a);k++)
{if(a%k==0)
{z=0;break;}
}
if(k>sqrt(a))
z=1;
return(z);}
int main()
{int n,i,j,k;
scanf("%d",&n);
for(k=3;2*k<=n;k++)
{i=2*k;
if(sushu(i-2)==1)
printf("%d=2+%d\n",i,i-2);
for(j=3;j<=i/2;j++)
{if(sushu(i-j)==1&&sushu(j)==1)
{printf("%d=%d+%d\n",i,j,i-j);break;}
}
}
return 0;}
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;
}
void main()
{
 int i,j,k,t,n;
 scanf("%d",&n);
 for(i=6;i<=n;i=i+2)
  if(i%2==0)
   {
    for(j=3;j<=(int)(i/2);j++)
    {
     for(k=2;k<=sqrt(j);k++)
      if(j%k==0) break;
     if(k>sqrt(j))
       {
        for(t=2;t<=sqrt(i-j);t++)
         if((i-j)%t==0) break;    
        }
      if(k>sqrt(j)&&t>sqrt(i-j))
	  {printf("%d=%d+%d\n",i,j,i-j);break;}
     }
    }
}
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;
		}
	}
}
void main()
{
	int x,k,n,i,j,a;
	scanf("%d",&a);
	for(x=6;x<=a;x+=2)
	{
		k=3;
	    do
		{
			i=3;
		    for(n=k;i<=sqrt(n);)
			{
			    for(i=3;i<=sqrt(n);i+=2)
				{
				    if(n%i==0)
					    break;
				}
				if(i<=sqrt(n))
					n=n+2;
			}
		    for(j=3;j<=sqrt(x-n);j+=2)
			{
			    if((x-n)%j==0)
				    break;
			}
		    k=n+2;
		}while(j<=sqrt(x-n));
		printf("%d=%d+%d\n",x,n,x-n);
	}
}
int prime(int n){
	int s,a=1,c,i;
	s=(int)sqrt(n)+1;
	if(n==3||n==5||n==7)
	    a=3;
	else{
		for(i=2;i<s;i++){
			c=n%i;
			if(c==0){
				a=2;
				break;
			}
			else
				a=3;
		}
	}
	return a;
}
int main()
{
	int n,m,o;
	int i,j;
	scanf("%d",&n);
	
	if(n==6)
		printf("6=3+3");
	else{
	    for(i=6;i<(n+1);i+=2){
		    for(j=3;j<(n/2+1);j+=2){
			    m=prime(j);
                o=prime(i-j);
				if((m+o)==6){
					printf("%d=%d+%d\n",i,j,i-j);
                    break;
				}
			}
		}
	}
	return 0;
}
int f(int x)
{
    int a,i;
	if((x==2)||(x==3))
		return(0);
	else
	{
	for(i=2;i<=sqrt(x);i++)
	{
		a=x%i;
		if(a==0)
			break;
	}
	if(a==0)
		return(1);
	else 
		return(0);
	}
}
void main()
{
	int j,k,n;
	scanf("%d",&n);
	for(j=6;j<=n;j+=2)
	{
		for(k=2;k<=(j/2);k++)
		{
		if((f(k)==0)&&(f(j-k)==0))
		{	printf("%d=%d+%d\n",j,k,j-k);
		    break;
		}
		
		}
	}
}
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;}
}
}
void main()
{
	int n,i,a,b,m,t,x;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{
                x=0;
		for(a=3;a<=i-3;a=a+2)
		{
			if(a==3)
			{
				int b=i-a;
				if(b==3)
				{
					x=1;
					printf("%d=%d+%d\n",i,a,b);
				}
				else
				{
		        		for(t=3;t<=sqrt(b);t=t+2)
					{
					    if(b%t==0)break;
					}
					if(b%t!=0)
					{
						x=1;
						printf("%d=%d+%d\n",i,a,b);
					}
				}
			}
			else
			{
		        	for(m=3;m<=sqrt(a);m=m+2)
				{
		          	  if(a%m==0)break;
				}
			  	if(a%m!=0)		
				{
	    	       			 int b=i-a;
		           		 for(t=3;t<=sqrt(b);t=t+2)
					{
				    	    if(b%t==0)break;
					}
				   	 if(b%t!=0)
					{
						x=1;
						printf("%d=%d+%d\n",i,a,b);
					}
				}
			}
			if(x==1)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 main()
{
	int n,i,j,k,a1,a2,a3,b;
	scanf("%d",&n);
	a1=(int)(n/2);
	for(i=6;i<=n;i+=2)
	{
		for(j=3;j<=a1;j++)
		{
			if(j%2==0)
				goto loap;
			if(j%2!=0)
			{
				a2=(int)(sqrt)(j);
				for(k=3;k<=a2;k++)
					if(j%k==0)
						goto loap;
			}
		b=i-j;
		a3=(int)(sqrt)(b);
		if(b%2==0)
			goto loap;
		else
		{
			for(k=3;k<=a3;k++)
				if(b%k==0)
					goto loap;
		}
		printf("%d=%d+%d\n",i,j,b);
		break;
loap:;
		}
	}
	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 n,a1,a2,root1,root2,i,j;
    cin >> n;
    for (i = 6;i <= n;i = i + 2)
    {
        for (a1 = 3;a1 <= i / 2;a1 = a1 + 2)
        {
            root1 = (int)sqrt((double)a1);
            for (j = 2;j <= root1;j ++)
            {
                if (a1 % j == 0)
                break;
            }
            if (j == root1 + 1)
            {
                  a2 = i - a1;
                  root2 = (int)sqrt((double)a2);
                  for (j = 2;j <= root2;j ++)
                  {
                      if (a2 % j == 0)
                      break;
                  }
                  if (j == root2 + 1)
                  {
                        cout << i << "=" << a1 << "+" << a2 << endl;
                        break;
                  }
            }
        }
    }
    return 0;
}
int main()
{
	int n,i=6,t,a,b=3,c,s;
	scanf ("%d",&n);
	for (i=6;i<=n;i++)
	{
		for(b=3;b<=(i/2);b++)
		{	
			for (t=2;t<=(sqrt(b));t++)
			{
				a=b%t;
				if(a==0&&b!=t)	
					break;	
			}
			if (a!=0)
			{
				for (s=2;s<=(sqrt(i-b));s++)
				{
					c=(i-b)%s;
					if (c==0&&s!=(i-b))	
						break;
				}
				if(c!=0)
				{
		        	printf("%d=%d+%d\n",i,b,(i-b));	
					break;
				}
			}
		}			
		i++;		
	}
	return 0;
}
main()
{
int n,i,j,m1,m2,a,b;
scanf("%d",&n);
for(i=6;i<=n;i+=2)
{
printf("%d=",i);
for(j=3;j<i;j+=2)
    {   int x=0;
        for(m1=3;m1<=sqrt(j);m1+=2)
        {
        if(j%m1==0)x=1;
        }
        if(x) continue;
        else
        { 
              a=i-j;
              int y=0;
              for(m2=3;m2<=sqrt(a);m2+=2)
              {
              if(a%m2==0)y=1;
              }
              if(y) continue;
              else printf("%d+%d\n",j,a);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;
}
int judge(int a)
{
	int i;
	
	for(i=3;i<=sqrt((float)a)+1;i+=2)
	{
		if(a%i == 0)
		{
			return 0;
			break;
		}
	}
	if(i>sqrt((float)a)+1 )
		return 1;
}

int main()
{
	int i,j,n;
	cin >>n;

	//for(i=3;i<=200;i+=2)
	//	cout <<i<<"?"<<judge(i)<<endl;

	for (i=6;i<=n;i+=2)
	{
		for(j=3;j<= i/2+1 ;j+=2)
		{
			if(judge(j) ==1 && judge(i-j)==1)
			{
				cout << i<<'='<<j<<'+'<<i-j<<endl;
				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 main()
{
	int n,a,b,s;
	int i,j,k;
	int flag=1,flag1=1;
	cin>>n;
	for(s=6;s<=n;s=s+2)
	{
	
			flag=1;
			flag1=1;
		
	
			for(a=3;a<=s/2;a=a+2)
			{
				for(i=3;i<=sqrt(a);i=i+2)
				{
					flag1=1;
					if(a%i==0 || a%2==0) 
					{	
						flag1=0;
						break;
					}
				}
				if(flag1==1)
				{
						for(i=3;i<=sqrt(s-a)+1;i=i+2)
						{	
							flag=1;
							if((s-a)%i==0 || (s-a)%2==0 ) 
							{
								flag=0;
								break;
							}
							else 
								continue;
						}
				}
			
				if(flag==1)
				{
					cout<<s<<'='<<a<<'+'<<s-a<<endl;
					break;
				}
			}
		
	}

	return 0;
}
void main()
{
	int a[9000];
	int i,N,n,t,k,o=3,s;
	scanf("%ld",&N);
	for(i=0,t=3;t<=N;t=t+2)
	{
		o=2;
		k=(int)sqrt(t);
		while(o<=k)
		{
			if(t%o==0)
			{
				o=0;
				break;
			}
			else
				o++;
		}
		if(o!=0)
		{
			a[i]=t;
			i++;
		}
		else
			continue;
	}
	o=i-1;
	k=6;
	while(k<=N)
	{
		n=o;   
		for(i=0;i<=o;)
		{
			t=k-a[i];
			while(n>=0&&a[n]>=t)
			{
				if(a[n]==t)
				{
					printf("%ld=%ld+%ld\n",k,a[i],a[n]);
					i=1000001;
					n=-1;
				}
				else
					n--;
			}	
				i++;
		}
		k=k+2;
	}
}
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;
}