semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
int sushu(long a)
{
	long i,temp;
	if(a==2||a==3)
		return 1;
	if(a%2==0)
		return 0;
	temp=(int)sqrt(a);
	for(i=3;i<=temp;i+=2)
		if(a%i==0)
			break;
	if(i>temp)
		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 sushu(int x){
	int b,i=0;
	for(b=2;b<=sqrt(x);b++){
		if(x%b==0){
			i++;
			break;
		}
		else continue;
	}
	if(i==0)
    return 0;
	else return x;
}
int main(int argc, char* argv[])
{
int n,x,b,c;
scanf("%d\n",&n);
for(x=6;x<=n;x+=2){
	for(b=2;b<=x/2;b++){
			c=x-b;
		    if(sushu(b)==0&&sushu(c)==0){
				printf("%d=%d+%d\n",x,b,c);
				break;
			}
			else continue;
	}
}
	
	return 0;
}
void main()
{
	long a,k,i;
    int f(long x);
	scanf("%ld",&a);
	for (i=6;i<=a;i=i+2) 
		for(k=3;k<=i/2;k=k+2)
		{
			if(f(k)==0&&f(i-k)==0) 
			{
				printf("%ld=%ld+%ld\n",i,k,i-k);
				break;
			}
		}
}
int f(long x)
{
	int j,sum;
	sum=0;
	for(j=3;j<=floor(sqrt(x));j=j+2)
		if (x%j==0) {sum=1;break;}
	return(sum);
}
void main()
{
	long int n,a,b,k,i,j;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{
		for(a=3,b=i-3;a<=b;a=a+2,b=b-2)
		{
			for(j=3;j<a/2;j=j+2)if(a%j==0)break;
			for(k=3;k<b/2;k=k+2)if(b%k==0)break;
			if(j>=a/2&&k>=b/2)break;
		}
		if(a<=b)printf("%ld=%ld+%ld\n",i,a,b);
	}
}
void main()
{
	unsigned i,n;
	int checkN(unsigned);
	scanf("%u",&n);
	for(i=6; i<=n; i+=2)
	{
		unsigned j=0,k=0;
		for(j=3; j<=i-3;j++)
		{
			if(checkN(j)==1 && checkN(i-j)==1)
			{
				printf("%u=%u+%u\n",i,j,i-j);
				break;
			}
		}
	}
}
int checkN(unsigned n)
{
	if(n%2==0)
		return 0;
	else
	{
		unsigned i;
		for(i=3; i<=sqrt(n); i+=2)
		{
			if(n%i==0)
			{
				return 0;
				break;
			}
		}
		if(i>sqrt(n))
			return 1;
	}
}
void main()
{
	long int n,i,j,k,l,t,s,a,b;
	scanf("%ld",&n);printf("\n");
	for(i=6;i<=n;i=i+2)
	{
		
		for(k=3;k<=i;k=k+2)
		{
			for(j=3;j<=sqrt(k);j++)
			{
				if(k%j==0)break;
			}
			if(j>sqrt(k))
			{b=i-k;
			for(l=2;l<=sqrt(b);l++)
			{
				
				if(b%l==0)break;
			}
			if(l>sqrt(b))
			{printf("%ld=%ld+%ld\n",i,k,b);break;}}
		}
	}
}
int IsPrime(int m)
{
	int k,i;
	k=sqrt(m);
	if(m==2) return 1;
	if(m%2!=0)
	{
		for(i=3;i<=k;i=i+2)
		   if(m%i==0)
			 break;
	    if(i==k+2||i==k+1)
		     return 1;
	    else return 0;
	}
}

void f(int n)
{
	int p,q,i;
	if(p==2&&IsPrime(n-2)==1) 
		printf("%d=2+%d\n",n,n-2);
	for(i=3;i<=n/2;i++)
	{
		p=i;
		q=n-p;
		if(IsPrime(p)==1&&IsPrime(q)==1){
			printf("%d=%d+%d\n",n,p,q);
			break;
		}
	}
}

void main()
{
	int n,i;
	scanf("%d",&n);
	i=6;
	while(i<=n)
	{
		f(i);
		i=i+2;
	};
}
void main()
{
   int n,i,j;
   int a[50001];
   scanf("%d",&n);
   for (i=2;i<=n;i++)
   {
	   a[i]=0;
	   for (j=2;j<=(int) sqrt(i);j++)
		   if (i%j==0) {a[i]=1;break;}
   }
   for (i=6;i<=n;i=i+2)
     for (j=3;j<=i/2;j=j+2)
       if (a[j]==0 && a[i-j]==0) {printf("%d=%d+%d\n",i,j,i-j);break;}
}
main()
{
      int i,j,k,m,n;
      int su(int a);
      scanf("%d",&n);
      for(i=6;i<=n;i=i+2)
      {
                         for(j=3;j<=n;j=j+2)
                         {
                                            if(su(j)&&su(i-j))
                                            {printf("%d=%d+%d\n",i,j,i-j);
                                            break;}
                         }
                         }
      
      }
int su(int a)
{
    int i,k;
    k=sqrt(a);
    for(i=3;i<=k;i=i+2)
    if(a%i==0)
    return 0;
    return 1;
    }
int main(int argc, char* argv[])
{
	int n,i,a,b,c=0,d;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{
		for(a=2;a<=(i/2);a++)
		{
			c=0;
			for(b=2;b<=(sqrt(a));b++)
			{
				if(a%b!=0)
					c=c;
				else
				{c++;
				break;}
			}
             d=i-a;
			for(b=2;b<=(sqrt(d));b++)
			{
				if(d%b!=0)
					c=c;
				else
				{c++;
				break;}
			}
			
			if(c==0)
			{
				printf("%d=%d+%d\n",i,a,d);
			    break;
			}
			
		}
	}
	return 0;
}
int check(int k)
{
	int x;
	if((k%2==0)&&(k!=2))
		return 0;
	for(x=3;x<=sqrt(k);)
	{
		if(k%x==0)
			break;
		x+=2;
	}
	if(x>sqrt(k))
		return 1;
	else 
		return 0;
}
void main()
{
	int n,i,j,m;
	scanf("%d",&n);
	for(i=6;i<=n;)
	{
		for(j=2;;j++)
		{
			if(check(j))
			{
				m=i-j;
				if(check(m))
				{
					printf("%d=%d+%d\n",i,j,m);
					break;
				}
			}
		}
		i+=2;
	}
}
int main()
{
	int h,k,s,m,n;
	int a,b,t=4;
	scanf("%d" , &n );
	for(t=6;t<=n;t=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;
			}
			if (m==1)
			{
				s=0;
				b=t-a;
				for(h=1;h<=sqrt(b);h++)
				{
					if(b%h==0) s=s+h;
				}
			}
			if(s==1)
			{
				printf("%d=%d+%d\n" , t , a , b);
				break;
			}
		}
	}
	return 0;
}
main()
{int sushu(int i); 
 int n,e,i,j,k,p,q,d;
 scanf("%d",&n);
 for(p=6;p<=n;p=p+2)
 {for(e=2;e<p;e++)
    {if((sushu(e)==1)&&(sushu(p-e)==1)) 
     {printf("%d=%d+%d",p,e,p-e);break;}
    }
  printf("\n");
 }




}


int sushu(int i)
{int j,p,s;
 s=sqrt(i);
 for(j=2,p=1;j<=s;j++)
    if(i%j==0) {p=0;break;}
 return (p);   
    }
int fflag(int n);
int main()
{
int i,n;
int t;
scanf("%d",&t);
for(i=6;i<=t;i+=2)
{
for(n=2;n<i;n++) 
if(fflag(n)) 
if(fflag(i-n))
{
printf("%d=%d+%d\n",i,n,i-n); 
break;
}
if(n==i) printf("error %d\n",i);
}
}

int fflag(int i) 
{
int j;
if(i<=1)return 0;
if(i==2)return 1;
if(!(i%2))return 0; 
for(j=3;j<=(int)(sqrt((double)i)+1);j+=2)
if(!(i%j))return 0;
return 1; 
}
int main()
{
	int i,j,p,q,N;
	double k,t;
	scanf("%d",&N);
	for(i=6;i<=N;i=i+2)
	{
		for(j=3;j<i;j++)
		{
			k=sqrt((double)j);
			for(p=2;p<=k;p++)
				if(j%p==0)
					break;
			if(p>k) {                         

				t=sqrt((double)(i-j));
				for(q=2;q<=t;q++)
					if((i-j)%q==0)
						break;
				if(q>t)
					break;
				else 
					continue;
			}else
				continue;

		}
		printf("%d=%d+%d\n",i,j,(i-j));	

	}
	return 0;
}
/**
  *file  ????????
  *author ???
  *date   10.23
  *function ???????????????????n?n <= 50000??? 
            ?6 ~ n??????????????????
*/
int main()
{
	int n, i, q, p, k;
	cin >> n;
	for(k = 6; k <= n; k = k+2)
	{
		for(i = 2; i <= sqrt((double)(k-2)); i++)			//???????n???2+?n-2????
		{	
			if((k-2) % i == 0)
			{
				break;
			}
		}
		if(i > sqrt((double)(k-2)))
		{
			cout<<k<<"=2+"<<k-2<<endl;
		}
		for(i = 3; i <= k/2; i=i+2)											//??[3,sqrt(n)]?????
		{
			for(q = 2; q <= sqrt((double)i); q++)
			{
				if(i % q == 0)
				{
					break;
				}
			}
			if(q > sqrt((double)i))											//????????
			{
				for(p = 2; p <= sqrt((double)(k-i)); p++)					//????????????
				{
					if((k-i) % p == 0)
					{
						break;
					}
				}
				if(p > sqrt((double)(k-i)))
				{
					cout << k << "=" << i << "+" << (k-i) << endl;
					break;
				}
	 		}
		}
	}
	return 0;
}
void main()
{
	int k,i,j,t,s,n;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{
		for(k=3;k<=i/2;k=k+2)
		{
			j=3;
			while(k%j!=0 && j<=sqrt(k)) j=j+2;
			if(j>sqrt(k))
			{
				t=i-k;
				if (t%2==0) continue;
				s=3;
				while(t%s!=0 && s<=sqrt(t)) s=s+2;
				if(s>sqrt(t))
				{
					printf("%d=%d+%d\n",i,k,t);
					break;
				}
			}
		}
	}
}
main()
{
	int flag[50001];
	int i,j,k,m,p,q,s;
	int n;
	scanf("%d",&n);
	int a[50000];
	flag[3]=1;
	for(i=3;i<50001;i=i+2)
	{
		flag[i]=1;
	}
	for(i=3;i<=223;i+=2)
	{
		if(flag[i])
		for(k=i*i;k<50001;k+=i)
			flag[k]=0;
	}
	m=0;
	for(j=3;j<50001;j+=2)
	{
		if(flag[j])
		{
			m=m+1;
			a[m]=j;			
		}
	}
   
	for(j=6;j<=n;j+=2)
	{
	printf("%d=",j);
	for(i=1;i<=m;i++)
	{
		if(flag[j-a[i]])
		{
			printf("%d+%d\n", a[i],j-a[i]);
				break;
		}
			
	}	
	}
	
}
int prime(int n)
{
	int i;
	if(n%2==0) return 0;
	for(i=3;i<=sqrt(n);i+=2)
		if(n%i==0)
			return 0;
	return 1;
}
void print(int n)
{
	int i;
	for(i=2;i<n-1;i++)
		if(prime(i)&&prime(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)
		print(i);
	return 0;
}
void main()
{
	int n,i,num,s,j,_s;
	scanf("%d",&n);
	for(num=6;num<=n;num+=2)
		for(s=3;s<=num/2+1;s+=2)
		{for(i=3;i<=sqrt(s);i+=2)
				if(s%i==0)
					break;
			if(i>sqrt(s)&&s%2!=0)
			{_s=num-s;
			for(i=3;i<=sqrt(_s);i+=2)
				if(_s%i==0)
					break;
				if(i>sqrt(_s)&&s%2!=0)
				{printf("%d=%d+%d\n",num,s,_s);break;}}}
}
int su(int z)
  {
       int i=2,t=0,k=sqrt(z);
       for(i=2;i<=k;i++)
        { 
          if(z%i==0)
          break;
        }
        if(i>k)  t=1;
        return t;
}
int main()
{
    int n,m,i,j;
    scanf("%d",&m);
    for(n=6;n<=m;n+=2)
      { 
          for(i=3;i<=n/2;i+=2)
           {  j=n-i;
             if(su(i)&&su(j))
             {printf("%d=%d+%d\n",n,i,j);
             break;}
          }
      }
      getchar();
      getchar();
      return 0;
}
main()
{
	int n,k,A,B,a,b,p,q;
	scanf("%d",&n);
	for(k=6;k<=n;k=k+2)
	{
		for(A=3;A<=k/2;A=A+2)
		{
			for(a=3;a<=sqrt(A);a=a+2)
				if(A%a==0)break;
				if(a>sqrt(A)) B=k-A;
				for(b=3;b<=sqrt(B);b=b+2)
					if(B%b==0)break;
					if(b>sqrt(B))
					{
						p=A;
						q=B;
						printf("%d=%d+%d\n",k,p,q);
						break;
					}
		}
	}
}
int main()
{
	int n , i , ii , j ,jj , q , k , kk; 
	cin >> n;
	for(i = 6;i <= n; i += 2)
	{
		ii = i / 2; 
		for(j = 3;j <= ii;j++)
		{
			jj = sqrt((float)j);
			for (q = 2;q <= (int)jj;q++)
				if (j % q == 0) break;
			if (q == (jj+1))
			{
				k = i - j;
				kk = sqrt((float)k);
				for (q = 2;q <= (int)kk;q++)
					if (k % q == 0) break;
				if (q == (kk+1))
				{
					cout << i << "=" << j << "+" << k << endl;
					break;
				}
			}
		}
	}

	return 0;
	
}
long int check(long int n)
{
	if(n==1)return 0;
	if(n==2)return 1;
	int j;
	for(j=2;j<=(int)sqrt(n);j++)if(n%j==0)return 0;
	return 1;
}
int main()
{
	long int n,i;
    scanf("%ld",&n);
	for(i=6;i<=n;i=i+2)
	{
		int j;
		for(j=3;j<i;j=j+2)
		{
			if(check(j)&&check(i-j))
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
	return 0;
}
int main()

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


		}
	}
	return 0;
}
int sushu(int a)
{   int i,gha;
    if (a%2==0)
	{  
		return 0;
	}
    gha=(int)sqrt(a);
	for (i=3;i<=gha;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+=2)
	{
		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;
}
int main()
{
	long n;
	scanf("%ld",&n);
	long su[25000];
	long i,j,num=0;
	for(i=2;i<25001;i++)
	{
		for(j=2;j<=sqrt(i);j++)
		{
			if(i%j==0)
				break;
		}
		if(j>sqrt(i))
		{
			su[num]=i;
			num++;
		}
	}
	long a,b;
	for(a=6;a<=n;a+=2)
	{
		for(i=0;;i++)
		{
			b=a-su[i];
			for(j=2;j<=sqrt(b);j++)
			{
				if(b%j==0)
					break;
			}
			if(j>sqrt(b))
				printf("%ld=%ld+%ld\n",a,su[i],b);
			if(j>sqrt(b))
				break;
		}
	}
	return 0;
}
int sushu(int a)
{
int i,m;
if(a==2||a==3)
	{	
	return(1);
	}
else
{
m=sqrt(a);
for(i=2;i<=m;i++)
	{
	if(a%i==0)
	break;
	}
	if(i>m)
	return(1);
	else
	return(0);
}
}
void main()
{
	int n,j,k,d,e;
	scanf("%d",&n);
	for(j=6;j<=n;j=j+2)
	{
	for(k=2;k<j;k++)
		{
		d=sushu(k);
		e=sushu(j-k);
		if(d==1&&e==1)
			{
			printf("%d=%d+%d\n",j,k,(j-k));
			break;
			}
		}
	}
}
int prime(int n)
{
	int m;
	for(m=2;m<=sqrt(n);m++)
		if(n%m==0) return 0;
		return 1;
}
int main()
{
	int n,i,temp1;
	cin>>n;
	for(i=6;i<=n;i++)
	{
		if(i%2==0)
		{
			for(temp1=2;temp1<i;temp1++)
				if(prime(temp1))
				{
					if(prime(i-temp1))
					{
						cout<<i<<"="<<temp1<<"+"<<i-temp1<<endl;
						break;
					}
				}
		}
	}
	return 0;
}
int isprime(long n)
{   long i;int j;j=1;
    if(n!=2)
    for(i=2;i<=sqrt(n);i++){{if(n%i==0){j=0;break;}}}
    return j;
}
int main()
{
    int n,i,j;
    scanf("%d",&n);
    for(j=3;j<=n/2;j++)
    {for(i=3;i<=2*j-1;i++)
    {
    if(isprime(i)&&isprime(2*j-i)){printf("%d=%d+%d\n",2*j,i,2*j-i);break;}
    }}

}
int pp(int a){
    int x,y;
    y=0;
    for(x=2;x*x<=a;x++){
        if(a%x==0){
        y=1;
        break;
        }
        }
    return y;
}
        
int main(){
    int n,i,j;
    cin>>n;
    for(i=6;i<=n;i=i+2){
       for(j=3;j<=i;j=j+2){
         if(pp(j)==0&&pp(i-j)==0){
            cout<<i<<"="<<j<<"+"<<i-j<<endl;
            break;
            }
            }
            }
                  return 0;
           }
void main()
{
int n,m=6,a=3,b,i,j,k;
scanf("%d",&n);
while(m<=n)
{
   a=3;
   loop:
   b=m-a;
   j=sqrt(a);
   for(i=2;i<=j;i++)
   if(a%i==0) {a=a+2;goto loop;}
   if(i>=j+1)
    {k=sqrt(b);
     for(i=2;i<=k;i++)
     if(b%i==0) {a=a+2;goto loop;}
     if(i>=k+1)
     printf("%d=%d+%d\n",m,a,b);
     }
   m=m+2;
  }
}
int main()
{
	int n,i,p,q,j,m;
	scanf("%ld",&n);
	for(i=6;i<=n;i=i+2)
	{
		for(p=3;p<=(i/2);p=p+2)
		{
			q=i-p;
			for(j=3;j<sqrt(p);j++)
			{
				if(p%j==0) break;
			}
			for(m=3;m<sqrt(q);m++)
			{
				if(q%m==0) break;
			}
			if(j>=((int)sqrt(p)+1)&&m>=((int)sqrt(q)+1))
			{
				printf("%ld=%ld+%ld\n",i,p,q);
				break;
			}
			else continue;
		}
	}
return 0;
}
int main()
{
	long n,i,j,k,x;
	int y;
	scanf("%d",&n);
	for(i=2;i<=n;i=i+2)
	{
		for(j=2;j<=i;j++)
		{
			if (j==2) 
			{
				x=i-2;
				if (x!=1)
				{
                y=1;
				
				for (k=3;k<=sqrt(x);k=k+2)
				{
					if ((x%k)==0) {y=0;break;}
				}
				if (x%2==0)
					y=0;
				if (y==1) printf("%d=2+%d\n",i,x);
				}
			}
			else
			{
				y=1;
			    for (k=3;k<=sqrt(j);k=k+2)
				{
				     if ((j%k)==0) {y=0;break;}
				}
                if (j%2==0) 
					y=0;
			    if (y==1) 
				{
				     x=i-j;
				     if (x!=1)
					 {
					 y=1;
                     for (k=3;k<=sqrt(x);k=k+2)
					 {
					     if ((x%k)==0) {y=0;break;}
					 }
                     if (x%2==0)
						 y=0;
					 if (y==1) 
					 {
						 printf("%d=%d+%d\n",i,j,x);break;
					 }
					 }
				}
			}
		}
	}
	return 0;
}
void main()
{
	int n,i,i1,j,j1,k,a,p;
	scanf("%d",&n);
	for(a=6;a<=n;a=a+2)
	{
		for(i=3;i<=a;)
		{
			i1=i;
			for(p=3;p<=sqrt(i);p=p+2)
			{
				if(i%p==0)
					i=i/p;
			}
			if(i==i1)
			{	
				j=j1=a-i;
				for(k=3;k<=sqrt(j);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;
		}
	}
}
main()
{
	long a,b,m,n,i,j;
	scanf("%ld",&n);
	for(m=6;m<=n;m=m+2)
	  {a=3;b=m-3;
	  abc:for(i=2;i<=sqrt(a);i++)
	  if(a%i==0){a=a+2;b=b-2;goto abc;}
	  for(j=2;j<=sqrt(b);j++)
	  if(b%j==0){a=a+2;b=b-2;goto abc;}
	  printf("%ld=%ld+%ld\n",m,a,b);
	  }
}
int main()
{
	long n,i,a,b,c,d,e,f;
	scanf("%ld",&n);
	i=6;
	while (i<=n)
	{
		a=3;
		e=1;
		f=1;
		while ((a<=i/2)&(e!=0||f!=0))
		{
			b=i-a;
			c=3;
			d=3;
			e=0;
			f=0;
			while (c<=sqrt(a))
			{
				if (a%c==0)
					e=e+1;
				else
					e=e;
				c++;
			}
			while (d<=sqrt(b))
			{
				if (b%d==0)
					f=f+1;
				else
					f=f;
				d++;
			}
			a=a+2;
		}
		printf("%ld=%ld+%ld\n",i,a-2,b);
		i=i+2;
	}
}
int main()
{
	int n,a[60000],i,j;
	cin>>n;
	a[1]=1;
	for (i=2;i<=n;i++)
		a[i]=a[i-1]+1;
	for (i=2;i<=n;i++)
		if (a[i]!=0)
			for (j=2;j*i<=n;j++)
				a[j*i]=0;
	for (j=6;j<=n;j+=2)
		for (i=3;i<=j/2;i++)
			if (j==a[i]+a[j-i])
			{
				cout<<j<<"="<<a[i]<<"+"<<a[j-i]<<endl;
				break;
			}
	return 0;
}
int main()
{
	int n,i,j,l,m,m1,k,k1;
	cin >> n;
	for (i=6;i<=n;i++)
	{
		if ((i%2)==0)
		{
			for (j=2;j<=i/2;j++)
			{
				k=(int)sqrt((double)j);
				if ((j%2)!=0)
				{
					for (m = 3 ; m <= k ; m+=2)        //????
					{		
						if ((j%m)==0)  break;         //???????       
					}
					if (m>k) 
					{
						l=i-j;
						k1=(int)sqrt((double)l);
						if ((l%2)!=0)
						{
							for (m1 = 3 ; m1 <= k1 ; m1+=2)        //????
							{		
								if ((l%m1)==0)  break;         //???????       
							}
							if (m1>k1)
							{
								cout << i << "=" << j << "+" << l << endl;
								break;
							}
						}
					}
				}
			}
		}
	}
	return 0;
}
int main(int argc, char* argv[])
{
	int i,p;
	int x,n;
	int f,g;
	int primep,primeq;
	scanf("%d",&x);
	
	for(n=6;n<=x;n++)
	{
		if(n%2==0)
		{
		  for(p=2;p<n;p++)
		  {
			primep=1;
			f=sqrt(p);
			for(i=2;i<=f;i++)
			{if(p%i==0){primep=0;break;}}
			if(primep!=0)
			{
				primeq=1;
				g=sqrt(n-p);
				for(i=2;i<=g;i++)
				{if((n-p)%i==0){primeq=0;break;}}
				if(primeq!=0&&(n-p)>1&&p<=(n-p)){printf("%d=%d+%d\n",n,p,n-p);break;}
		
			}
		  }
		}
	}
	return 0;
}
int prime(int x);
void 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)&&prime(i-j))
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
}
int prime(int x)
{
	int k;
	for(k=3;k<=sqrt(x);k++)
	{
		if(x%k==0)
			break;
	}
	if(k>sqrt(x))
		return 1;
	else
		return 0;
}
int main(int argc, char* argv[])
{
	int i,j,k=1,l,n,m,flag;
	int a[25000],b[25000],c[25000]={0};
	a[0]=3;
	c[3]=1;
	scanf("%d",&n);
	for(i=5;i<=n;i=i+2)
		for(j=3;j<i;j=j+2)
		{
			if(i%j==0)
				break;
			if(j>sqrt(i))
			{
				a[k]=i;
				c[a[k]]=1;
				k++;
				break;
				
			}
		}
	
	for(i=6;i<=n;i=i+2)
	{
		for(j=0;j<=k;j++)
		{
			if(c[i-a[j]]==1)
			{	printf("%d=%d+%d\n",i,a[j],i-a[j]);
			break;}
		}
	}
	return 0;
}
void main ()
{
	int n,f[30000];
	int i,j,k,l;
	int a=0,b=0,c,temp; 
	int x,y;


	scanf("%d",&n);

	for(i=6;i<=n;i++)
	{
		if(i%2==0)
		{
			f[a++]=i;
		}
	}

	for(i=0;i<=a;i++)
	{
		for(j=3;j<f[i];j+=2)
		{
			x=sqrt(j);

			for(k=2;k<=x;k++)
			{
				if(j%k==0)break;
			}
			if(k>=x+1)
			{
				temp=f[i]-j;
				y=sqrt(temp);
				for(l=2;l<=y;l++)
				{
					if(temp%l==0)break;
				}
				if(l>=y+1)
				{
					printf("%d=%d+%d\n",f[i],j,temp);break;
				}
			}
			
		}
	}
}
int su(int k);

int main()
{
	int n;
	scanf("%d",&n);
	int f = 6;
	int k;
	while(f<=n)
	{
		int i = 2;
		while(i<=(f/2))
		{
			if ( su(i) == 1 )
			{
				k = f - i;
				if ( su (k) == 1)
				{
					printf("%d=%d+%d\n",f,i,k);
					break;
				}
			}
			i++;
		}
		f += 2;
	}
	return 0;
}

int su(int k)
{
	int i;
	for(i = 2; i <= sqrt(k);i++)
	{
		if( k%i == 0 )
		{
			return 0;
		}
	}
	return 1;
}
int main()
{
	int n,i,k,j,m,a;
	scanf("%d",&n);
	for(i=6;i<=n;i+=2)
	{
		for(j=3;j<i;j++)
		{
		   for(k=2;k<=sqrt(j);k++)
		   {
		       if(j%k==0)
			   break;
		   }
		       if(k>sqrt(j))
			   {
		        	m=i-j;
			   }
		 	for(a=2;a<=sqrt(m);a++)
			{
	        	if(m%a==0)
			    break;
			}
		       if(a>sqrt(m))
			   {
		      	printf("%d=%d+%d\n",i,j,m);
				break;
			   }
		}
	}
	return 0;
}
int main()
{
	int shisushu(int j);
	int n,i,j,p,k;
	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 k,p;
	if(j==2||j==3||j==5||j==7||j==11||j==13||j==17)return 1;
	else{
	k=sqrt(j);
	for(p=2;p<=k;p++)
		if(j%p==0)break;
		if(p>k)return 1;}
	return 0;
}
int prime(int n)
{
	int i=0, t=0;
	float f=0;
	f=sqrt(n);
	t=(int)f;
	if(n<=10)
	{
		if((n==2)||(n==3)||(n==5)||(n==7)) return(1);
		else return(0);
	}
	else
	{
		if(n%2==0) return(0);
		else
		{	for(i=3;i<=t;i++)
			{
				if(n%i==0) break;
			}
			if(i==t+1) return(1);
			else return(0);
		}
	}
}
void divide(int a)
{
	int i;
	for(i=2;i<=a;i++)
	{
		if((prime(i)==1)&&(prime(a-i)==1))
			break;
	}
	printf("%d=%d+%d\n", a, i, a-i);
}
int main()
{
	int m, n;
	int i, j;
	scanf("%d", &m);
	if(m>=6)
	{
		for(i=6;i<=m;i=i+2)
			divide(i);
	}
}
int main()
{
	int n,g=1,i,j,l,y,k1,k2,k3;
	cin >>n;
	n=2*(n/2);
	for (i=6;i<=n;i=i+2)
	{
		k1=n/2;
		y=i-2;
		k2=(int)sqrt((double)y);
		for(j=2;j<=k2;k2++)
		{
			g=1;
			if (y%j==0)
			{
				g=0;
				break;
			}
		}
		if (g==1)
		{
			cout << i<<"="<<"2+"<<y;
		}
		else
		{
		for (l=3;l<=k1;l=l+2)
		{
			g=1;
			y=i-l;
			k3=(int)sqrt((double)l)+1;
			k2=(int)sqrt((double)y);
				for(j=2;j<=k3;j++)
		{
			if (l%j==0)
			{
				g=0;
				break;
			}
		}
					for(j=2;j<=k2;j++)
		{
			if (y%j==0)
			{
				g=0;
				break;
			}
		}
		if (g==1)
		{
			cout << i<<"="<<l<<"+"<<y<<endl;
			break;
		}
		}
		}
	}
	return 0;
}
/**/
isprime(int i)// ??i????,???i
{
	int j,flag=1;
	double k;
	k=sqrt(i);
	for(j=2;j<=k;j++)//????2???6?????????2?????
	{
		if(i%j==0)
		{
			flag=0;
			break;
		}
	}
		return flag;
}

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

	}
	return 0;
}
int sushu(int x)
{
	int j,z=0;
	if(x%2==0)
		z=1;
	else
	{
		for(j=3;j<=sqrt(x);j+=2)
		{
			if(x%j==0)
			{
				z=1;
				break;
			}
		}
	}
	return(z);
}
main()
{
	int max,i,j,a,b;
	scanf("%d",&max);
	for(i=6;i<=max;i+=2)
	{
		for(j=2;j<=i/2;j++)
		{
			a=sushu(j);
			b=sushu(i-j);
			if(a==0&&b==0)
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}
	}
	return 0;
}
void main()
{
	int h,a,b,m,n,k,i,s,j,r,q,t,o,u,p;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{
		
		for(a=3;a<=i/2;a=a+2)
		{
			h=0;
			b=i-a;
			p=sqrt(a);
			for(j=3;j<=p+2;j++)
			{   
				if(p+2==3)
				{
					j=p+3;break;
				}
				r=a%j;
				if(r==0) break;
			}
			if(j==p+3)
			{
				o=sqrt(b);
				for(u=3;u<=o+2;u++)
				{
					if(o+2==3)
					{
						u=o+3;break;
					}
					r=b%u;
					if(r==0) break;
				}
				if(u==o+3)
				{
					printf("%d=%d+%d\n",i,a,b);h=1;
				}
			}
			if(h==1) break;
		}
	}
}
int main()
{
	int n,i,m,k,j,a,b,c;
	scanf("%d",&n);
    for(i=1,c=6;i<=(n/2-2);i++,c++,c++)
	{
		for(m=3;;m++,m++)
		{
			for(a=1;a<=sqrt(m);a++,a++)
			{
				if(m%a==0)
					k=a;
			}
			for(b=1;b<=sqrt(c-m);b++,b++)
			{
				if((c-m)%b==0)
					j=b;
			}
			if(k==1&&j==1)
				break;
		}
    printf("%d=%d+%d\n",c,m,c-m);
	}
	return 0;
}
void main()
{
	int i,m,j,k;
	unsigned int n,n1,n2,N;
	scanf("%u",&n);
	for(N=6;N<=n;N+=2)
	{
	printf("%u=",N);
	n1=sqrt(N);
	i=2;
	n2=N-2;
	for(i=2;i<=n1;i++)
	{
		if(n2%i==0)i=n2;
	}
	if(i<n2)printf("2+%u\n",n2);
	for(i=3;i<=N/2;i+=2)
	{
		n2=N-i;
		if(n2%2==0)break;
		else
		{
			for(j=3;j<=sqrt(n2);j+=2)
			{
			if(n2%j==0)j=n2+4;
			}
		}
		if(i%2==0)break;
		else
		{
			for(k=3;k<=sqrt(i);k+=2)
			{
			if(i%k==0)j=n2+4;
			}
		}
		if(j<=n2)
		{printf("%d+%u\n",i,n2);break;}
	}
	}
}
void main()
{
    int n,i,j,k,t,m;
	float a,b;
	scanf("%d",&n);
	for (m=6;m<=n;m++)
	{	if (m%2==0)
	{  printf("%ld=",m);
		for (i=3;i<=m-3;i++)
		{	a=sqrt(i);
		  for (k=2;k<=a;k++)
			  if (i%k==0) break;
		  if(k>a)
		  {   t=m-i;
		      b=sqrt(t);
		      for (j=2;j<=b;j++)
				  if (t%j==0) break;
			if (j>b)
			{	printf("%d+%d\n",i,t);
			break;}
		  }
		  }
	}
	
}
}
int main(int argc, char* argv[])
{
	long n,i,j,k,x;
	int asd;
	scanf("%d",&n);
	for (i=6;i<=n;i=i+2)
	{
		for(j=2;j<=i;j++)
		{
			if (j==2) 
			{
				x=i-2;
				if (x!=1)
				{
                asd=1;
				
				for (k=3;k<=sqrt(x);k=k+2)
				{
					if ((x%k)==0) {asd=0;break;}
				}
				if (x%2==0) asd=0;
                
				if (asd==1) printf("%d=2+%d\n",i,x);
				}
			}
			else
			{
				asd=1;


			    for (k=3;k<=sqrt(j);k=k+2)
				{
				     if ((j%k)==0) {asd=0;break;}
				}
                if (j%2==0) asd=0;
			    if (asd==1) 
				{
				     x=i-j;
				     if (x!=1)
					 {
					 asd=1;

                     for (k=3;k<=sqrt(x);k=k+2)
					 {
					     if ((x%k)==0) {asd=0;break;}
					 }
                     if (x%2==0) asd=0;
					 if (asd==1) {printf("%d=%d+%d\n",i,j,x);break;}
					 }
				}
			}
		}
	}


	
	
		


	return 0;
}
int isprime(int p)
{
	int i;
	if(p%2==0)
	{
		if(p==2)
		{
			return 1;
		}
		return 0;
	}
	for(i=3;i<=sqrt(p);i=i+2) 
	{
		if(p%i==0)
		{
			return 0;
		}
	}
	return 1;
}


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