semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
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 main()
{
	int n , m=0 , s=0 , h;
	cin >>n;
	cout <<endl;
	for (int i=6; i <= n;i=i+2)//?????????
	{
	   for (int j=3;j <= (i/2);j=j+2)
	   {
	       h=0;m=0;s=0;//????????
	       for (int k =1;k <= floor(sqrt(j));k=k+2)
		 if (j%k==0) m=m+1;//??j?????
	       if (m==1) 
	          {
		     for (int l =1;l <= floor(sqrt(i-j));l=l+2)
		      if ((i-j)%l==0) s=s+1;//??i-j?????
		     if (s==1) 
		        {
			  cout <<i<<"="<<j<<"+"<<i-j<<endl;
			  h=h+1;
		         }
		 }
	       if (h==1)break; //??????????????????
	   }
	}
	return 0;
}
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 main()
{
   int i,j,n,p[50000];
   scanf("%d",&n);
   for(i=3;i<n;i++)
   {
	   int a=0;
	   for(j=2;j<=sqrt(i);j++)
	   {
		   if(i%j==0)  
		   {
			   a=1;
			   break;
		   }
	   }
	   if(a==0)  p[i]=i;
   }
   for(int h=6;h<=n;h=h+2)
   {
       int b,c;
	   for(b=3;b<=h/2;b=b+2)
	   {
	       c=h-b;
		   if(p[c]==c&&p[b]==b){
			   printf("%d=%d+%d\n",h,b,c);
			   break;
		   }
	   }
   }
   return 0;
}
int main(){
	int n;
	scanf("%d",&n);
	int r=3,s=0,q=0;
	int p[100000];
    p[0]=2;
    for (r=3;r<=n;r++){
	   for(s=0;p[s]*p[s]<r;s++){
	        if (r%p[s]==0){
		        break;
			}
	   }
	   if(p[s]*p[s]>r){
		  p[q+1]=r;
		  q++;
	   }
	}

	int i,j,k,m;
	for (i=6;i<=n;i=i+2){
		for(j=0;p[j]<=i/2;j++){
			m=i-p[j];
			for(k=0;p[k]*p[k]<i;k++){
				if(m%p[k]==0){
					break;
				}
			}
			if(p[k]*p[k]>i){
				printf("%d=%d+%d\n",i,p[j],m);
				break;
			}
		}
	}
	return 0;
}
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);
	}
}
void main()
{
	

	int n,a[20000]={0},b[50001]={0};
	scanf("%d",&n);
	int i,qu=0;
	for(i=2;i<=n;i++)
	{
		int t=sqrt(i);
		int k,count=0;
		for(k=2;k<=t;k++)
		{
			if(i%k==0)
			{
				count++;
				break;
			}
		}
		if(count==0)
		{
			a[qu]=i;
			qu++;
			b[i]=1;
		}
	}
	int l=0;
	for(i=6;i<=n;i++)
	{
		if(i%2==1)
			continue;
		for(l=0;l<qu;l++)
		{
			if(b[i-a[l]]==1)
			{	printf("%d=%d+%d\n",i,a[l],i-a[l]);
			break;
			}
		}
	}



}
void main()
{
	int n,i=6,j,k1,k2,k3,m,p,q,h,k;
	scanf("%d",&n);
	for(;i<=n;i=i+2)
	{
		printf("%d=",i);
		for(m=3;m<=(i/2);m+=2)
		{
			k1=sqrt(m);
			h=i-m;
			k3=sqrt(h);
			if(m==3)
			{
				if(h==3)
				{printf("3+3\n");break;}
				else
					{
						for(k=2;k<=k3;k++)
						if(h%k==0)break;
						if(k>k3){printf("3+%d\n",h);break;}
				     }
			}
            else 
				{
					for(j=2;j<=k1;j++)
			        if(m%j==0)break;
				    if(j>k1)
				    {
					p=i-m;
					k2=sqrt(p);
					 if(p==3)printf("%d+3\n",m);
					  else
					   {
						for(q=2;q<=k2;q++)
						  if(p%q==0)break;
						  if(q>k2){printf("%d+%d\n",m,p);break;}
			       	    }
		             }
	            }
			}
		}
}
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;


}
void main()
{
	int a,b,c,d,f,g,h,n;
	scanf("%d",&n);
	for (h=6;h<=n;h+=2)
	{
	for(a=3;a<h;a+=2)
	{
		c=(int)sqrt(a);
		for(d=2;d<=c;d++)
		{
			if (a%d==0)
				break;
		}
		if (d<=c)
		{
			continue;
			a+=2;
		}
		b=h-a;
	    g=(int)sqrt(b);
	    for(f= 2;f<=g;f++)
		{
			if (b%f==0)
			break;
		}
	    if (f>g)
		{
		   printf("%d=%d+%d\n",h,a,b);
		   break;
		}
	}
	}
}
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,m,a,b,i,k,leap;
	scanf("%d",&n);
	for(m=6;m<=n;m=m+2)
	{
        a=3;
		
		for(;;a=a+2)
		{for(;a<=m;a=a+2)
		   {
		for(i=3,leap=1;i<=sqrt(a);i=i+2)
			
			if (a%i==0||a%2==0){leap=0;break;}
			if(leap==1)break;
		   }
		b=m-a;
        for(k=3;k<=sqrt(b);k=k+2)
		if (b%k==0||b%2==0){leap=0;break;}
		
		if(leap==1)
		{printf("%d=%d+%d\n",m,a,b);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;
	}
}
void main()
{
  int n,i,j,a,b;
  char aa,bb;
  scanf("%d",&n);
  for (i=6;i<=n;)
  {
	  for (a=3;a<=i/2;)
	  {
		  b=i-a;
		  aa=bb='y';
		  for (j=3;j<=sqrt(a);) 
		  {
			  if(a%j ==0) 
			  {
				  aa='n';
				  break;
			  }
			  j=j+2;
		  }
		  for (j=3;j<=sqrt(b);) 
		  {
			  if(b%j ==0) 
			  {
				  bb='n';
			      break;
			  }
			  j=j+2;
		  }
		  if (aa=='y' && bb=='y')
		  {
			  printf("%d=%d+%d",i,a,b);
			  printf("\n");
			  break;
		  }
		  a=a+2;
	  }
	  i=i+2;
  }
}
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;
	}
}
void main()
{
	int huige(int a);
	int n,i,j,l,a[50000];
	int k;
	scanf("%d",&n);
	a[0]=2;
	j=1;
	for(i=3;i<n;i=i+2)
	{
		if(huige(i)==1)
		{
			a[j]=i;
			j++;		
		}
	}
	for(l=6;l<=n;l=l+2)
	{
		k=0;
        for(i=0;i<j;i++)
		{ 
		    if (huige(l-a[i])==1)
			{
			printf("%d=%d+%d\n",l,a[i],l-a[i]);
			k=1;
			}
		if(k==1)
			break;
		}
	}
}
int huige(int a)
{
	int i;
	int m=1;
	for(i=3;i<=sqrt(a);i++)
	{
		if(a%i==0)
			m=0;
	}
	if(a%2==0)
		m=0;
	return(m);
}
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()
{
	int n,i,j,k,l,b;
	scanf("%d",&n);
	for(i=6;i<=n;i+=2)
	{
		printf("%d=",i);
		for(j=3;j<=(i/2);j+=2)
		{
			b=1;
			for(l=2;l<=sqrt(j);l++) 
			{
				if(j%l==0) 
				{
					b=0;
				}
			}
			if(b)
			{
				for(k=2;k<=sqrt(i-j);k++)
				{
					if((i-j)%k==0)
					{
						b=0;
					}
				}
			}
			if(b) break;
		}
		if(b)
		{
			printf("%d+%d\n",j,i-j);
		}
	}
}
int main()
{
	int m, n, a, b, p, q, i;
	cin >> n;
	for (i = 6; i <= n; i = i + 2)
	{
		m = 3;
		while (m < i)
		{
			q = 0;
			for (p = 3; p <= sqrt(m); p = p + 2)
			{
				if (m % p == 0)  {q = 1; break;}
			}
			if (q == 0)
			{
				a = m; 
				b = i - m;
				for (p = 3; p <= sqrt(b); p = p + 2)
				{
					if (b % p == 0)  {q = 1; break;}
				}
				if (q == 0) {cout << i << '=' << a << '+' << b << endl; break;}
				else m = m + 2;
			}
			else m = m + 2;
		}
	}
	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;
	}
}
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;
					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);
						} 
					}
				}
			}
			if(x==1)break;
		}
	}
}
int main()
{
	int n,i,a,k,p,q,m;
	scanf("%d",&n);
	for (m=6;m<=n;m=m+2)
	{for (a=3;a<=m/2;a=a+2)
	{	p=(int)sqrt(a);
		     q=(int)sqrt(m-a);
	for (i=2;i<=p;i++)
	{if(a%i==0)break;}
	for (k=2;k<=q;k++)
	{	if((m-a)%k==0)break;}
	if (i>p&&k>q)
	{printf("%d=%d+%d\n",m,a,m-a);break;}
	}
	}
	  return 0;
	
}
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;
			}
}
void main()
{
	int su[25000]={0},i,j=1,n,q,u,k,a1,a2,p,sum=0;
	scanf("%d",&n);
	su[0]=2;
	for(i=3;i<=n/2;i++)
	{
		u=1;
		q=(int)pow(i,0.5);
		if(q<3)
		{
			if(i%2!=0)
			{
				su[j]=i;
				j++;
			}
		}
		if(q>=3)
		{
		    if(i%2==0)
			{
				u=0;
			}
			else if(i%2!=0)
			{
				for(k=2;k<=(q+1)/2;k++)
				{
					if(i%(2*k-1)==0)
					{
						u=0;
						break;
					}
				}
			}
	        if(u!=0)
			{
			    su[j]=i;
			    j++;
			}
		}
	}
	for(j=0;j<=24999;j++)
	{
		if(su[j]!=0)
		{
			sum=sum+1;
		}
		else break;
	}
	for(i=3;i<=n/2;i++)
	{
		p=2*i;
		for(j=0;j<=sum-1;j++)
		{
			a1=su[j];
			a2=p-su[j];
			int sushu(int x);
			if(sushu(a2)==1)
			{
				printf("%d=%d+%d\n",p,a1,a2);
				break;
			}
		}
	}
}
int sushu(int x)
{
	int v=1,e,t;
	e=(int)pow(x,0.5);
	if(x==2)
	{
		v=1;
	}
	if(x>2&&e<3)
	{
		if(x%2==0)
		{
			v=0;
		}
	}
	else
	{
		if(x%2==0)
		{
		    v=0;
		}
		else
		{
			for(t=2;t<=(e+1)/2;t++)
			{
				if(x%(2*t-1)==0)
				{
					v=0;
					break;
				}
			}
		}
	}
	return(v);
}
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 main()
{
    int n, i, j, k, l, m, o;
	cin >> n;
	for ( i = 6; i <= n; i = i + 2 )
	{
		for ( j = 2; j <= ( i / 2 ); j ++ )
		{
			k = sqrt (j);
			for ( l = 2; l <= k; l ++ )
			{
				if ( j % l == 0 )
					break;
			}
			if ( l == k + 1 )
			{m = sqrt ( i - j );
               for ( o = 2; o <= m; o ++ ) 
			   {
				   if( ( i - j ) % o == 0 )
					   break;
			   }
			   if ( o == m + 1 )
				   break;}
		}
		cout << i << "=" << j << "+" << i - j << endl;
	}
	return 0;
}
int main()
{
	int n,i,k,m=0,x[99999],y[99999],j,h;
	scanf("%d",&n);
	for(i=6;i<=n;i++,i++)
	{
		for(k=3;k<i;k++)
		{
			for(j=2;j<=sqrt(k);j++)
			{
				if(k%j==0)
					break;
			}
	    	if(j>sqrt(k))
			{
			   for(h=2;h<=sqrt(i-k);h++)
			   {
				if((i-k)%h==0)
					break;
			   }
			   if(h>sqrt(i-k))
			   {	
				   x[m]=k;
			       y[m]=i;
			 	    m++;
					break;
			   }
			}
		}
	}
	for(j=0;j<m;j++)
	printf("%d=%d+%d\n",y[j],x[j],y[j]-x[j]);
	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;
		}
	}
}
int joy(int a, int b)
{	
	int i;
	for (i=2;i*i<=a;i++)
	{
		if (a%i==0)
		{
//			printf("i=%d\n",i);
			return 0;
		}
	}
	for (i=2;i*i<=b;i++)
	{
		if (b%i==0)
		{
//			printf("i=%d\n",i);
			return 0;
		}
	}
	return 1;
}


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

	for (i=2;i<=k/2;i++)
	{
		x=i;
		y=k-x;
		if (joy(x,y)==1)
		{		
				printf("%d=%d+%d\n",k,x,y);
				break;
		}
	}
	}

	return 0;

}
int issushu(int a)
{
	int i,sqrta;
	if(a%2==0)
	{
		return 0;
	}
	sqrta=(int)sqrt(a);
	for(i=3;i<=sqrta;i++)
	{
		if(a%i==0)
		{
			return 0;
		}
	}
	return 1;
}
int main(int argc, char* argv[])
{
	int n,i,j;
	scanf("%d",&n);
	for(j=3;j<=n;j++)
	{
		if(j%2==0)
		{
			
			for(i=2;i<=(j/2);i++)
			{
				if(issushu(i)&&issushu(j-i))
				{
					printf("%d=%d+%d\n",j,i,j-i);
					break;
				}
			}
		}
	}
		
		
	return 0;
}
int w(int m)
{
int d=2,e=1;
for(;d<=sqrt(m);d=d+1)
{
	if(m%2==0)
		{e=0;
		break;}
	if(m%d==0)
		{e=0;
		break;}
}
return(e);
}
void main()
{
int a;
scanf("%d",&a);
int b=2,c=6;
for(;c<=a;c+=2)
{
	b=2;
		for(;b<c;b++)
		{
			if(w(b)!=0&&w(c-b)!=0&&(c-b)!=2)
				{printf("%d=%d+%d\n",c,b,c-b);
				break;}		
		}
}
	
}
main()
{
	long a,i,q,p,k,j;
	scanf("%ld",&a);
	for(i=6;i<=a;i+=2)
	{
		p=3;
		test:j=3;
		while(p*2<=i&&j*j<=p)
		{
			if(p%j==0)
			{
				p+=2;
				j=3;
			}
			else j+=2;
		}
		q=i-p;
		k=3;
		while(k*k<=q)
		{	
			if(q%k==0)
			{
				p+=2;
				goto test;
			}
			else 
				k+=2;
		}
		printf("%ld=%ld+%ld\n",i,p,q);
	}
}
main()
{   
    int n,m,z,a,b,i;
    scanf("%d",&n);
       for(m=6; m<=n; m=m+2)
       {
               for(a=3; a<=(m/2); a=a+2)
               {
                 for(i=3,z=0; i<=(int)sqrt(a); i=i+2)     //??a  
                      {if(a%i==0) {z=1;break;}}       
                 if(z==0)                             //shi 
                 b=m-a;                               
                 for(i=3,z=0; i<=(int)sqrt(b); i=i+2) //??b 
                      {if(b%i==0) {z=1;break;}}
                 if(z==0)
                 {printf("%d=%d+%d\n",m,a,b);  break;}
               }
       }  
 }
int sushu(int p)
{
	int i;
	int k=0;
	for (i=2;i<=sqrt(p);i++)
		if (p%i==0)
			k++;
	if (k>0)
		return 0;
	else
		return 1;
}
int main()
{
	int n,m;
	scanf ("%d",&m);
	int a,b,p,q;
	n=6;
	while (n<=m)
	{
		for (a=2;a<=n/2;a++)
		{
			b=n-a;
			if (a!=2)
				p=a%2;
			else
				p=1;
			q=b%2;
			if (p&&q)
			{
				if (sushu(a)&&sushu(b))
				{
					printf ("%d=%d+%d\n",n,a,b);
					break;
				}
			}
		}
		n=n+2;
	}
	return 0;
}
int prime (int x)
{
	int i,j;
	if (x==3||x==5||x==7)
	{
		return 1;
	}
	else
	{
		for (i=3;i<=sqrt(x);i+=2)
		{
			if (x%i==0)
			{
				return 0;
				break;
			}
		}
		return 1;
	}
}
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+=2)
		{
			if (prime(j)+prime(i-j)==2)
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
	return 0;
}
int f(int a)
{
int c=1;
int i;
if(a%2==0)
	c=0;
else
{
	for(i=3;i<=sqrt(a);i=i+2)
		if(a%i==0)
		{
			c=0;
			break;
		}
}
return(c);
}
main()
{
int n;
int j;
int k;
scanf("%d",&n);
for(k=6;k<=n;k=k+2)
{
for(j=2;j<=k/2;j++)
{
	if((f(j)==1)&(f(k-j)==1))
	{
		printf("%d=%d+%d\n",k,j,k-j);
		break;
	}
}
}
}
void main()
{
	
	int t,a=6,a1,a2,i;
	scanf("%d",&t);
	
	
	
	while(a<=t)
		
	{
		for(a1=3;a1<=a/2;a1+=2)
	{
		for(i=3;i<=sqrt(a1);i+=2)
		{
			if(a1%i==0) break;
		}
		
		if(i>sqrt(a1))
			{
			a2=a-a1;
		
			for(i=3;i<=sqrt(a2);i+=2)
				{
				if(a2%i==0) break;
				}
			if (i>sqrt(a2)) 
			{
				printf("%d=%d+%d\n",a,a1,a2);a1=a;
			}
			}
		
	}
	a=a+2;
	}

}
int isprime(int a)
{
	int i,k;
	if(a%2==0){
		return 0;
	}
    k=(int)sqrt(a);
	for(i=3;i<=k;i=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=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 p)
{
	int i;
	for(i=2;i<=(int)sqrt(p);i++)
		if(p%i==0) return 0;
	return 1;

}

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

			return 0;
}
int main()
{
	int su[5200],i,j,k,n,flag,shu[100000][2];
	su[0]=3;
	su[1]=5;
	su[2]=7;
	su[3]=11;
	su[4]=13;
	su[5]=17;
	su[6]=19;
	su[7]=23;
	su[8]=29;
	su[9]=31;
	su[10]=37;
	su[11]=41;
	su[12]=43;
	su[13]=47;
	k=14;
	for(i=53;i<50000;i=i+2)
	{
		flag=1;
       if(i%3==0)continue;
	   if(i%5==0)continue;
	   if(i%7==0)continue;
	   if(i%11==0)continue;
	   if(i%13==0)continue;
	   if(i%17==0)continue;
	   if(i%19==0)continue;
	   if(i%23==0)continue;
	   if(i%29==0)continue;
	   if(i%31==0)continue;
	   if(i%37==0)continue;
	   if(i%41==0)continue;
	   if(i%43==0)continue;
	   if(i%47==0)continue;
	   for(j=53;j<=pow(1.0*i,0.5);j=j+2)
		   if(i%j==0){flag=0;break;}
		   if(flag)
		   {
       su[k]=i;
	   k++;
		   }
	}
    for(i=0;i<k;i++)
		for(j=0;j<=i;j++)
		{
			shu[su[i]+su[j]][0]=su[i];
			shu[su[i]+su[j]][1]=su[j]; 
		}
		cin>>n;
    for(i=6;i<=n;i=i+2)
		cout<<i<<"="<<shu[i][1]<<"+"<<shu[i][0]<<endl;
	return 0;
}
int yan(int n)
{
	if(n==2)
	return 1;
	else if(n!=2)
	{
		int i,c;
		double s;
		s=sqrt(n);
		c=(int)s+1;
		for(i=2;i<=c;i++)
		{
			if(i==2||(i+1)%2==0)
			{
			if(n%i==0)
			{
				return 0;
			}
			}
			if(i==c)
			return 1;	
		}
	}
}
main()
{
     int n,i,j;
     scanf("%d",&n);
     for(i=6;i<=n;i++)
     {
     	if(i%2==0)
     	{
     		double s;
     		s=i/2;
     		int c;
     		c=(int)s+1;
			if(yan(i-2)==1) printf("%d=2+%d\n",i,i-2);
			else if(yan(i-2)==0)
			for(j=3;j<=c;j++)
			{
				if((j+1)%2==0)
				{
					int xx,yy;
					xx=j;
					yy=i-j;
					if(yan(xx)==1&&yan(yy)==1)
					{
					printf("%d=%d+%d\n",i,j,i-j);
					break;	
					}
				}	
			}
     	}
     }
}
int sushu(int a)
{
	if(a>2&&a%2==0)return 0;
	else{
			if(a==2)return 1;
			else
				{	
					for(int i=3;i<sqrt(a)+1;i=i+2)
						if(a%i==0)return 0;
					
				}
	}
	return 1;
    
}
int main()
{
	int a,b,c,d,i,t,m;
	scanf("%d",&c);
	for(m=6;m<=c;m=m+2)
		{d=0;
		for(i=3;i<=m/2;i=i+2)
			{t=m-i;
				if(sushu(i)!=0&&sushu(t)!=0)
				{
				printf("%d=%d+%d\n",m,i,t);
				break;
	
				}
				
			}
		}

}
//
//  main.cpp
//  ????
//
//  Created by ? ? on 12-11-21.
//  Copyright (c) 2012? ? ?. All rights reserved.
//

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

int main(int argc, const char * argv[])
{int i,j;
    cin>>n;
    for(i=6;i<=n;i+=2)
    {
        for (j=3; j<=i/2; j++) {
            if(prime(j)&&prime(i-j))
            {
                cout<<i<<"="<<j<<"+"<<i-j<<endl;break;
            }
                
        }
    }
    return 0;
}
int main(int argc, char* argv[])
{
    int h,k,s,m,n;
	int a,b,t=4;
	scanf("%d",&n);
        printf("6=3+3\n");
	for(t=6;t<=n;t+=2)
	{
		for(a=2;a<t/2;a++)
		{
			m=0;
			for(k=1;k<=sqrt(a);k++)
			{
				if(a%k==0)
					m=m+k;
			}
			s=0;
			if(m==1)
			{
				b=t-a;
				for(h=1;h<=sqrt(b);h++)
				{
					if(b%h==0)
						s+=h;
				}
			}
			if(s==1)
			{
				printf("%d=%d+%d\n",t,a,b);
				break;
			}
		}
	}
	return 0;
}
main()
{
	int n,i,j,k;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{	printf("%d=",i);
		for(j=3;j<=i/2;j=j+2)
		{	for(k=3;k<=sqrt(i);k=k+2)
			{	if(j%k==0&&j!=k) 
				break;
				else if((i-j)%k==0&&(i-j)!=k)
				break;
			}
			if(k>=sqrt(i)) 
			{	printf("%d+%d\n",j,i-j);
				break;
			}
		}
	}
}