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

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

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

void inits()
{
     a[1]=0;
     u=0;
     for(int i=2;i<=n;i++)
     {
         if(zs(i))
         {
             a[i]=1;
             u++;
             b[u]=i;
         }
         else
         a[i]=0;
     }
     return ;
}

int main()
{
    scanf("%d",&n);
    inits();
    for(int i=6;i<=n;i++)
    {
        if(!(i%2))
        {
            for(int j=1;j<=u;j++)
            {
                if(a[b[j]] && a[i-b[j]])
                {
                   printf("%d=%d+%d\n",i,b[j],i-b[j]);
                   break;
                }
                if(b[j]>i/2)
                break;
            }
        }
    }
    return 0;
}
int main()
{
	int n, i, x, k, j, l;
	cin >> n;
	for (i = 6; i <= n; i = i + 2)
	{

		for (x = 3; x <= n / 2; x = x + 2)
		{
			l = sqrt((double)x);
			for (j = 2; j <= l; j ++)
			{
				if (x % j == 0)
				{
					break;
				}
			}
			if (j != l + 1)
			{
				continue;
			}
			if ((i - x) == 2)
			{
				break;
			}
			k = sqrt((double)(i - x));
			for (j = 2; j <= k; j ++)
			{
				if ((i - x) % j == 0)
				{
					break;
				}
			}
			if (j == k + 1)
			{
				cout << i << "=" << x << "+" << i-x << endl;
				break;
			}
		}
	}
	return 0;
}
int s[50010]={1,1,0};
int main()
{
int i,j,n;
for(i=2;i<300;i++)
{
if(!s[i]);
j=i;
while(i*j<50010)
{
s[i*j]=1;j++;
}
}
scanf("%d",&n);
for(i=6;i<=n;i+=2)
{
for(j=2;j<=i/2;j++)
{
if(!s[j] && !s[i-j])
{
printf("%d=%d+%d\n",i,j,i-j);
break;
}
}
}
return 0;
}
void main()
{
  long prime(long x);
  long n,i,j;
  scanf("%d",&n);
  for(i=6;i<=n;i=i+2)
    for(j=3;j<=i/2;j=j+2)
     {
       if(prime(j)==1&&prime(i-j)==1)
       {printf("%ld=%ld+%ld\n",i,j,i-j);
        break;}
     }
}
 
long prime(long x)
{
    int flag;
    long i;
    if(x==2) 
      flag=1;
    if(x%2==0&&x!=2) 
      flag=0;
    if(x%2!=0)
   { 
        flag=1;
        for(i=3;i<=sqrt(x);i=i+2)
        {
        if(x%i==0)
          {
           flag=0;
           break;
          }
        }
   }
   return(flag);
}
void main()
{
	long int n,i,k=6;
	scanf("%ld",&n);
	int a[50000];
	for (i=3;i<=n;i=i+2)
	{
		long int j=3;
		a[i]=1;
		while (j<=sqrt(i))
		{
			if (i%j!=0)
				j=j+2;
			else
			{
				a[i]=0;
				j=i;
			}
		}
	}
	i=3;
	do
	{
		while(i<k)
		{
			if(1==(a[i]&&a[k-i]))
			{
				printf("%ld=%ld+%ld\n",k,i,k-i);
				i=n;
			}
			else
				i=i+2;
		}
		i=3;
		k=k+2;
	}
	while (k<=n);
}
int judge(int a)
{
	int temp;
	if(a%2!=0)
	{
		temp=0;
		int i;
		for(i=3;i<=sqrt(a);i++)
			if(a%i==0)
				temp++;
	}
	if(temp==0)return 1;
	else return 0;
}
void main()
{
	int n,m,i;
	scanf("%d",&n);
		for(m=6;m<=n;m++)
		{
			if(m%2==0)
			{
				for(i=3;i<m;i++)
					if(judge(i)==1)
					{
						int j;
						j=m-i;
						if(judge(j)==1)
						{
							printf("%d=%d+%d",m,i,j);
						    break;
						}else continue;
					}
			    printf("\n");
			}
			

		}
}
char stack[MAX];
int count=0;

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


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


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

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

   int a[10000],m,n,i,j=1,k,l;
   a[0]=2;
   for(m=3;m<=50000;m++)
   {
     for(i=2;i<=sqrt((float)m);i++)
       if(m%i==0)  break;
     if(i>sqrt((float)m))
      a[j++]=m;
      
   }
   scanf("%d",&n);
   for(i=3;i<=n/2;i++)
   {
     printf("%d=",2*i);
     for(k=0,l=j-1;k<=l;)
     {
       if(a[k]+a[l]==2*i) {printf("%d+%d\n",a[k],a[l]); break;}
       else if(a[k]+a[l]<2*i)  k++;
         else l--;
     } 
   }
       printf("\n");

}
int main()
{
	int x,i,j,k=0,p[N],a[N]={0,0};
	for(i=2;i<N;i++)p[i]=1;
	//for(i=0;i<N;i++)b[i]=i;
	for(i=2;i<N;i++)
	if(p[i])
	{a[k++]=i;
	for(j=1;i*j<N;j++)
	p[i*j]=0;
	}
	for(x=6;x<=N;x+=2)
	{for(i=0;a[i]!=0;i++)
	for(j=i;j<N;j++)
    if(x==a[i]+a[j]) printf("%d=%d+%d\n",x,a[i],a[j]);
 return 0;
 }
}
void main()
{
	int N,n,m,i,j,flag;
	scanf("%d",&N);
	for(n=6;n<=N;n+=2)
	{
		for(m=3;m<n;m+=2)
			{
			flag=1;
			for(i=2;i<=sqrt(m);i++)
				if(m%i==0){flag=0;break;}
			if(flag==1)
				{
				m=n-m;
				for(i=2;i<=sqrt(m);i++)
					if(m%i==0){flag=0;break;}
				}
			else continue;
			if(flag==1){printf("%d=%d+%d\n",n,n-m,m);break;}
			m=n-m;
			}
	}
}
int sushu(int n)
{int i=2;
for(i=2;i<=sqrt(n);i++)
if(n%i==0) break;
if(i>sqrt(n)) return 1;
else return 0;
}
void main()
{
long int m;
scanf("%d",&m);
int j=6,i=2;
for(j=6;j<=m;j=j+2)
{
	for(i=2;i<=j/2;i++)
	{
		if(sushu(i)==1&&sushu(j-i)==1)
	break;
	}
	printf("%d=%d+%d",j,i,j-i);
	printf("\n");



}

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

		}
		else continue;
	}


}
void main()
{
	long i,n,k,t,s;
	scanf("%ld",&n);
	for(i=6;i<=n;i+=2)
	{
		for(k=2;k<=i/2;)
		{
			loop: for(t=2;t<=sqrt(k);t++) {if(k%t==0) {k++;t=2;}}
			s=i-k;
			for(t=2;t<=sqrt(s);t++) {if(s%t==0) {k++;goto loop;}}
			printf("%ld=%ld+%ld\n",i,k,s);break;
		}
	}
}
void main()
{
	int ss(long a);
	long n,j;
int i;
scanf("%d",&n);
for(i=6;i<=n;i+=2)
{
for (j=3;ss(j)!=1||ss(i-j)!=1;j+=2);
printf("%d=%d+%d\n",i,j,i-j);



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

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

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

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

	for(i=3;i<=n2;i++)
	{
		i2=i+i;
		for(j=3;j<=i2;j++)
		{
			a=j;b=i2-j;
			if (sushu(a)==1 && sushu(b)==1)
			{
				printf("%d=%d+%d\n",i2,a,b);
				break;
			}
		}

	}

}

int sushu(int a)
{
	int i,b=0,x=1;
	if(a==2) x=1;
	if(a>2) 
	{
		for(i=2;i<(a/2);i++)
		{
			if((a%i)==0) b++;
			else b=b;		
		}
		if(b>0) x=0;
		
	}
	return(x);
}
int zhisu(int x)
{
	int i,a;
	a=0;
	if((x==2)||(x==3)||(x==5)||(x==7))a=1;
	for(i=3;i<=sqrt(x);i+=2)
	{	
		if(x%2==0){a=0;break;}
		else if(x%i==0){a=0;break;}
		else a=1;
	}
	return a;
}
int main()
{
	int number,A,B,i,j;
	scanf("%d",&number);
	for(j=6;j<=number;j+=2)
	{
	for(i=2;i<=j/2;i++)
	{
		A=zhisu(i);
		B=zhisu(j-i);
		if(A==1&&B==1)
		{
			printf("%d=%d+%d\n",j,i,j-i);
			break;
		}
	}
	}
	return 0;
}
int f(int a)
{int i,b;
b=sqrt(a);
if(a%2==0)
return 0;
for (i=3;i<=sqrt(a);i+=2)
{if(a%i==0)
return 0;}
return 1;
}
int main()
{int n,j,k;
scanf("%d",&n);
for(j=6;j<=n;j+=2)
{
	for(k=3;k<=j;k++)
if(f(k)==1&&f(j-k)==1)
{printf("%d=%d+%d\n",j,k,j-k);
break;}
}
return 0;
}
int p(long a)
{
	int i;
	for(i = 2; i <= sqrt(a); i++)
	{
		if(a % i == 0)
			return 0;
	}
	return 1;
}

int main()
{
	long n, i, t;
	scanf("%ld", &n);
	for(i = 6; i <= n; i += 2)
	{
		for(t = 2; t <= i / 2; t++)
		{
			if(p(t))
				if(p(i - t))
				{
					printf("%ld=%ld+%ld\n", i, t, i - t);
					break;
				}
		}
	}
	return 0;
}
int prime[50000];
inline int isprime(int n)
{
  int i;
  if (prime[n]!=-1)return prime[n];
  else
    {
      for (i=2;i<=n/2;i++)
        {
          if ((n%i==0))
            {prime[n]=0;return 0;}
        }
      prime[n]=1;return 1;
    }
}

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

  for (i=2;i<50000;i++)prime[i]=-1;
  prime[2]=1;
  scanf("%d",&n);
  for (k=6;k<=n;k=k+2)
    {
      for (i=2;i<=k/2;i++)
        {
          if (isprime(i))
            {
              if (isprime(k-i))
                {
                  printf("%d=%d+%d\n",k,i,k-i);
                  break;
                }
            }
        }
    }
  return 0;
}
int main ()
{
    int a,b=3,c,n,i,j,l,x,y;
	scanf("%d",&n);
	for (a=6;a<=n;a=a+2)
	{
		for (b=3;b<=a;b=b+2)
		{
		x=(int)sqrt(b);
		for (i=2;i<=x;i++)
			if(b%i==0) break;
			if (i>=x+1) 
			{
				c=a-b;
				y=(int)sqrt(c);
				for (j=2;j<=y;j++)
					if (c%j==0) break;
					if (j>=y+1) {printf("%d=%d+%d\n",a,b,c);break;}
			} 
	}
}
}
int main()
{
	int n,a,b,num=6;
	cin>>n;
	while(num<=n)
	{
		for(int a=3;a<=n/2;a+=2)
		{  
			int countera=0;
		     double a0;
			a0=sqrt(a);
			for(int i=3;i<=a0;i+=2)
			{
				if(a%i==0) countera++;
			}
			if(countera!=0) continue;
				b=num-a;
			int counterb=0;
			double b0;
				b0=sqrt(b);
			for(int j=3;j<=b0;j+=2)
			{
				if(b%j==0)  counterb++;
			}
			if(counterb!=0) continue;
			else {
				cout<<num<<"="<<a<<"+"<<b<<endl;
			break;
			}
		}
		num+=2;
	}
	return 0;
}
void main()
{
 int i,j,k,flag1,flag2,n;
 scanf("%d",&n);
 for(i=6;i<=n;i++)
  if(i%2==0)
   {
    for(j=3;j<=(int)(i/2);j++)
    {
     flag1=0;
     for(k=2;k<=sqrt(j);k++)
      if(j%k==0){flag1=1;break;}
     if(flag1==0)
       {
        flag2=0;
        for(k=2;k<=sqrt(i-j);k++)
         if((i-j)%k==0){flag2=1;break;}       
        }
      if(flag1==0&&flag2==0)
	  {printf("%d=%d+%d\n",i,j,i-j);break;}
     }
    }
}
void main()
{
    long n,a,b,j,k,i,t,s,q=0;
	scanf("%ld",&n); 
     for(i=6;i<=n;i=i+2)
   { 
	   printf("%ld=",i);
	   for(a=3;a<=(i/2);a=a+2)
	   {   t=sqrt(a);
	       b=i-a;
		   s=sqrt(b);
		   q=0;
   	      for(j=3;j<=t;j=j+2)
		  {
			  if (a%j==0)
			  q=1;
		  }
		  for(k=3;k<=s;k=k+2)
		  {
			  if (b%k==0)
			  q=1;
		  }
	      if (q==0)
		  {
			  printf("%ld+%ld",a,b);
		  break;
		  }
	   }    
	printf("\n");
   }
}
int test(int x)
{
	int i;
	if(x==1) return 1;
	if(x==3) return 0;
	for(i=2;i<=sqrt(x);i++)
	{	if(x%i==0)
		{
			return 1;
		}
	}
	return 0;
}
int main()
{
	int i,j,n;
	scanf("%d",&n);
	for(i=6;i<=n;i++)
	{
		if(i%2==0)
		{
			for(j=3;j<n;j++)
			{
				if(test(j)==0)
				{
					if(test(i-j)==0)
					{
						printf("%d=%d+%d\n",i,j,i-j);
						break;
					}
				}
			}
		}
	}


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

}
int main()
{
	int n,i,j,k,a,b,m,h,p;
	int f,u;
	scanf("%d",&n);
	for(i=6;i<=n;i+=2)
	{
		for(j=3;j<i-1;j++)
		{
			m=0;
			f=sqrt(j);
			for(k=2;k<=f;k++)
			{
			    if(j%k==0)
				{
					m+=1;
				}
			}
			if(m==0)
			{
				a=j;
			}
		    h=0;
			u=sqrt(i-a);
	 	    for(p=2;p<=u;p++)
			{
			    if((i-a)%p==0)
				{
				    h+=1;
				}
			}
		    if(h==0)
			{
			    b=i-a;
			    printf("%d=%d+%d\n",i,a,b);
				break;
			}
		}
	}
    return 0;
}
int main()
{
	int n,i,j,t,k,p=1,u=1,c,x,y;
    scanf("%d",&n);
	for(i=6;i<=n;i+=2)
	{
	   for(j=3;j<=i/2;j++)
	   {
		   c=(int)sqrt(j);
		   	   if(j%2==0)
			   {
				   goto loop;
			   }
		   for(k=3;k<=c;k++)
		   {
			   if(j%k==0)
				   goto loop;
		   }
			   x=i-j;
			   y=(int)sqrt(x);
			      for(t=3;t<=y;t+=2)
				  {
				     if(x%2==0)
					 {
                        goto loop;
					 }
				     else if(x%t==0)
                        goto loop;
					 
				  }
					   printf("%d=%d+%d\n",i,j,x);
					   goto er;
		   loop:;
	   }
er:;
	}
	return 0;
}
int sushu(int a)
{
	int b;
	int t;
    t=1;
	for(b=3;b<=sqrt(a);b=b+2)
	{
		if(a%b==0)
		{
			t=0;
			break;
		}
	}
	return t;//1shisushu,0shiheshu
}
void main()
{
	int n;
	scanf("%d",&n);
	int c,b,a;
	for(c=6;c<=n;c=c+2)
	{
		for(a=3;a<=n/2;a=a+2)
		{
			if(sushu(c-a)&&sushu(a))
			{
				printf("%d=%d+%d\n",c,a,c-a);
				break;
			}
		}
	}
}
void main()
{
	int a=3,b,m=6,i,j,n;
	
		scanf("%d",&n);
	while(m<=n)
	{
		while(a<=m/2)
		{
        
		for(i=2;i<=sqrt(a);i++)
			if(a%i==0) break;
		if(i>sqrt(a))
		{
			b=m-a;
           
			for(j=2;j<=sqrt(b);j++)
				if(b%j==0) break;
			if(j>sqrt(b))
			{
				printf("%d=%d+%d\n",m,a,b);
				a=3;
				break;
			}
			else
				a+=2;
		}
		else
			a+=2;
		}
		m+=2;
	}
	}
/*
 * file    competition 1_5
 * author  ??
 * date    2010-10-22
 * description
           ????????
*/



int main()
{
	int n, i, k, t1, t2, p, j;
	cin >> n;
	for (i = 6; i <= n; i = i + 2)
	{
       	for (j = 3; j <= i; j = j + 2)
		{
			t1 = 0;
	    	t2 = 0;
	       	p = sqrt(j);            
	       	for (k = 3; k <= p; k = k + 2)
        		if (j % k == 0) break;
			if (k > p) t1 = 1;
	     	if (t1 == 1) 
			{
	     		p = sqrt(i-j);            
            	for (k = 3; k <= p; k = k + 2)
	       	    	if ((i - j) % k == 0) break;
	           	if (k > p) t2 = 1;
		   		if (t2 == 1) break;
			}
		}
       	cout << i << "=" << j << "+" << i - j << endl;
	}
	return 0;
}
void main()
{
	int i,n;
	char sieve[50001];
	sieve[0]=0;
	sieve[1]=0;
	for (i=2;i<50001;i++) sieve[i]=1;
	for (i=2;i<sqrt(50001);i++)
	{
		if (sieve[i]==1)
		{
			for (n=i*i;n<50001;n+=i)
			{
				sieve[n]=0;
			}
		}
	}
	int input;
	scanf("%d",&input);
	for (i=6;i<=input;i+=2)
	{
		for (n=3;n<i;n++)
		{
			if (sieve[n]==1&&sieve[i-n]==1)
			{
				printf("%d=%d+%d\n",i,n,i-n);
				break;
			}
		}
	}
}
int prime(int m);
int main(void)
{
 int n,m,a,b,c,count=0;
 cin>>n;
 for(m=6;m<=n;m=m+2)
 {
	 for(a=2;a<=m/2;a++)
	 {
		 c=0;
		 b=m-a;
         if(prime(a)==1&&prime(b)==1)
		 {
			 printf("%d=%d+%d\n",m,a,b);
			 count++;
			 if(count%5==0)printf("\n");
			 c=1;
		 }
         if(c==1)break;
	 }
 }
 return 0;
}
int prime(int m)
{
 int n;
 for(n=2;n<=sqrt(m);n++)
 if(m%n==0)
 break;
 if(n>sqrt(m))
 return 1;
 else return 0;
}
int sushu (int x)
{ 
	
	if (x==2)
		return 1;
	else
	{
		int i,c;
		
		c=sqrt(x);
		for(i=2;i<=c;i++)
		{
			if(x%i==0)
				return 0;
		}
		return 1;
	}
}
int main(int argc, char* argv[])
{
	int n,i,j;
	scanf ("%d",&n);
	for(i=6;i<=n;i++)
	{ 
		if(i%2==1)
			continue;
		else
		{
			
			for (j=2;j<=i/2;j++)
			{ 
				if(sushu(j)&&sushu(i-j))
				{	 printf("%d=%d+%d\n",i,j,i-j);
				break;
				}
			}
		}
		
	}
	
	return 0;
}
void main()
{
    int k,i,j;
    scanf("%d",&k);
    for(i=6;i<=k;i+=2)
    {
        for(j=3;2*j<=k;j+=2)
        {
            if(su(j)==1&&su(i-j)==1)
            {
                printf("%d=%d+%d\n",i,j,i-j);
                break;
            }
        }
    }
}
int su(int x)
{
    int i,j=1,k=x;
    if(k%2==0) j=0;
    else
    {
        for(i=3;i*i<=k;i+=2)
        {
            if(k%i==0) j=0;
        }
    }
    return j;
}
void main()
{
	int n,i,i1,j,j1,k,a,p;
	double m,m1;
	scanf("%d",&n);
	for(a=6;a<=n;a=a+2)
	{
		for(i=3;i<=a;)
		{
			i1=i;
			m=sqrt(i);
			for(p=3;p<=m;p=p+2)
			{
				if(i%p==0)
					i=i/p;
			}
			if(i==i1)
			{	
				j=j1=a-i;
				m1=sqrt(j);
				for(k=3;k<=m1;k=k+2)
				{
					if(j%k==0)
					j=j/k;
				}
				if(j==j1)
					{printf("%d=%d+%d\n",a,i,j);break;}
				else i=i+2;
			}
			else i=i1+2;
		}
	}
}
int main()
{
	int i,j,k,n,a=0,b=0;
	int zhi(int x);
	scanf("%d",&n);
	for(i=6;i<=n;i++)
	{
		for(j=3;j<=i;j++)
		{
			if(zhi(j))
			{
				if(zhi(i-j))
				{
					a=j;b=i-j;break;
				}
			}
			j++;
		}
		printf("%d=%d+%d\n",i,a,b);
		i++;
	}
	return 0;
}

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

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

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

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

int prime(int n){
	int i;
	float q;
	
	if (n==2)
	{
		return 1;}
	else 
	{
		q=(float)sqrt(n);
		for (i=2;i<=q;i++)
		{
			if(n%i==0) break;
		   
		}
		  if(i>q) return 1;
		  else return 0;
	  }
	
}
int main()
{
	int i,n,j,k,m,t;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{

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

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


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

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


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

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




int main()
{
	unsigned short int n;
    scanf("%d",&n);
    for(unsigned short int j=6;j<=n;j++)
	{
		if(j%2!=0) continue;
		else
		{
			unsigned short p;
			unsigned short q;	
	        for(p=3;p<j;p++)
			{
	    		q=j-p;
				if(Isprimenumber(p)==1&&Isprimenumber(q)==1) break;
			}
			printf("%d=%d+%d",j,p,q);
	        printf("\n");
		}
	}
}
int prime(int x);
int prime(int x)
{
	int n;
	int isprime=1;
	if(x==1) {return isprime;}
	else
	{
		for(n=3;n<=sqrt(x);n=n+2)
		{
			if(x%n==0)
			{isprime=0;return isprime;break;}
		}
	}
	return isprime;
}
int main()
{
	int y,k,i;
	scanf("%d",&y);
	for(i=6;i<=y;i+=2)
	{
		for(k=3;k<=y;k=k+2)
		{
			if(prime(k)+prime(i-k)==2)
			{printf("%d=%d+%d\n",i,k,i-k);break;}
		}
	}
	return 0;
}
int a(int m)
{
	int i;float k;
	k=sqrt((float)m);
	for(i=2;i<=k;i++)
		if(m%i==0)
			break;
	if(i>k)return 1;
	else return 0;
}
void main()
{
	int w;int q;int n;
	scanf("%d",&w);
	for(q=6;q<=w;q++)
	if(q%2==0)
		for(n=3;n<=q/2;n++)
			if(n%2!=0)
				if(a(n)==1&&a(q-n)==1)
				{
					printf("%d=%d+%d\n",q,n,q-n);
					break;
				}
}
void main()
{
    int a,b,c,i,n;
    scanf("%d",&n);
    for(i=6;i<=n;i=i+2)
    {
    	a=i-3;
    	b=3;
    	while(b<=sqrt(a))
    	{
    		if(a%b==0||(i-a)%b==0&&(i-a)!=b)
    		{
    		b=3;
    		a=a-2;
    		}
    		else 
    		b=b+2;
    	}
    	printf("%d=%d+%d\n",i,i-a,a);
    }
}