semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
void main()
{
     long int m,n,a,b,i,j,s;
     double t;
     scanf("%ld",&n);
     for(m=6;m<=n;m+=2)
     {
                       for(a=3;a<m;a+=2)
                       {
                                        s=1;
                                        t=sqrt(a);
                                        for(i=3;i<=t;i++)
                                        {
                                                               if((a%i)==0)
                                                               {
                                                               s=0;
                                                               break;
                                                               }
                                                               }
                                                               if(s==1)
                                                               {
                                                                       b=m-a;
                                                                       t=sqrt(b);
                                                                       for(j=3;j<=t;j++)
                                                                       {
                                                                                              if((b%j)==0)
                                                                                              {
                                                                                              s=0;
                                                                                              break;
                                                                                              }
                                                                                              }
                                                                                              }
                                                                                              if(s==1)
                                                                                              {
                                                                                                      printf("%ld=%ld+%ld\n",m,a,b);
                                                                                                      break;
                                                                                                      }
                                                                                                      }
                                                                                                      }
                                                                               
                                                                                                      }
//???2010?10?29?
//???1000010586_???
//???????????

int main()
{
	int n , i , j , k1 , k2 , t , a , b , m , l , g;
	cin >> n;
	for ( i = 6 ; i <= n ; i = i + 2)
	{
		for ( j = 2 ; j <= i - 2 ; j++)
		{
			m = 0;
			k1 = sqrt(j);
			for ( t = 2 ; t <= k1 ; t++ )
			{
				if ( j % t == 0 ) m = 1 ;
			}
			if ( m == 0 )
			{  
				g = 0;
				k2 = sqrt(i-j);
				for ( l = 2 ; l <= k2 ; l++)
				{
					if ( (i - j) % l == 0 ) g = 1;
				}
				if ( g == 0 )
				{ cout << i << "=" << j << "+" << i - j << endl;break;} 
			}
		}
	}
	return 0;
}
main()
{
	int a,b,c,d,i,j;
	scanf("%d",&a);
	for(c=6;c<=a;c+=2)
	for(i=3;i<=c;i+=2)
	{
		for(b=1,j=3;j<=sqrt(i);j+=2)
		{
			b=i%j;
			if(!b)
				break;
		}
		if(b)
		{
			d=c-i;
			for(b=1,j=3;j<=sqrt(d);j+=2)
			{
				b=d%j;
				if(!b)
					break;
			}
		}
		if(b)
		{
			printf("%d=%d+%d\n",c,i,d);
			break;
		}
	}
}
void main()
{
	long prime(long);
	long x,y,t;
	long i;
	scanf("%ld",&x);
	for(t=6;t<=x;t++,t++)
    for(i=3;i<=t/2;i++,i++)
	{
	int flag1=1,j;
	for(j=3;j<=sqrt(i)&&flag1==1;j++,j++)
	{
		if(i%j==0)
			flag1=0;
	}
	if(flag1)
			y=t-i;
	int flag2=1,k;
	for(k=3;k<=sqrt(y)&&flag2==1;k++,k++)
	{
	if(y%k==0)
	flag2=0;
	}
	if(flag2)		
	{
		printf("%ld=%ld+%ld\n",t,i,y);
		break;
	}
	}
}
int isprimenumber(int m)
{
	int i,isprime=1;
	if (m%2==0)
	{
		if(m==2)
		{
		return isprime;
		}
		isprime=0;
		return isprime;
	}
	for(i=3;i<=sqrt(m);i=i+2)
	{
		if(m%i==0)
		{
			isprime=0;
			break;
		}
	}
	return isprime;
}

void gb(int a)
{
	int j;
	printf("%d=",a);
	for(j=2;j<=(a/2);j=j+1)
	{
		if((isprimenumber(j))&&(isprimenumber(a-j)))
		{
			printf("%d+%d\n",j,a-j);
		    break;
		}
	}
}

int main()
{
	int n,k;
	scanf("%d",&n);
	for (k=6;k<=n;k=k+2)
	{
		gb(k);
	}
	return 0;
}
void main()
{
     int n,i,p;
     int prime(int x);
     scanf("%d",&n);
     for(i=6;i<=n;i+=2)
         for(p=3;p<=i/2;p+=2)
 	    if(prime(p)&&prime(i-p))
	    { 	
	       printf("%d=%d+%d\n",i,p,i-p);
	       break;
	    }
}

int prime(int n)
{
    int i,t=1;
    for(i=2;i<=sqrt(n);i++)	
        if(n%i==0)
        {
	  t=0;
	  break;
        }
    return(t);
}
int isPrime(int n)
{
	int i;
	if (n%2 == 0)
		return 0;
	for (i=3; i<=sqrt(n); i++)
	{
		if ( n%i == 0 )
			return 0;
	}

	return 1;
}

int main()
{
	int n, i, j;
	scanf("%d", &n);
	for (i=6; i<=n; i+=2)
	{
		if (isPrime(i-2))
			printf("%d=%d+%d\n", i, 2, i-2);
		for (j=3; j<n/2; j+=2)
		{
			if (isPrime(j) && isPrime(i-j))
			{
				printf("%d=%d+%d\n", i, j, i-j);
				break;
			}
		}
	}
	return 0;
}
void main()
{
	int i,j,m,n,k;
	
	
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
    
	    for(j=3;j<i;j=j+2)
			
		{
		for(k=2;k<=sqrt(j);k++)
		{if(j%k==0) break;}
				if(k>sqrt(j))
					m=i-j;
				for(k=2;k<=sqrt(m);k++)
				{if(m%k==0) break;}
				if(k>sqrt(m)&&j<=m&&m>1)
		
				{printf("%d=%d+%d\n",i,j,m);
				break;}
		}
		
				
        
	
}
void main()
{
 int n,i,j,k,m=0,b[50000];
 int flag[50000] = {0};
 scanf("%d",&n);
 for(i=3;i<n;i++)
 {
  if(i%2!=0)
  {
   k=1;
   for(j=2;j<= sqrt(i);j++) 
   {
    if(i%j==0)
     k=0;
   }
   if(k==1)
   {
    b[m]=i;
    flag[i] = 1;
    m++;
   }
  }
 }
 for(k=6;k<=n;k+=2)
 {
  for (i = 0; i <= m; i++) 
   if (flag[k - b[i]] == 1) 
   {
    printf("%d=%d+%d\n",k,b[i],k - b[i]);
    break;
   }
 }
}
int ss(int x)
{
  double m;
  int i,f=0;
  m=sqrt(x);
  if(x%2==0) return 0;
  for(i=3;i<=m;i++)
    {
      if(x%i==0)               
       {
         f=1;
         break;                        
       }      
    }
  if(f==1) return 0;
  else return 1;
}
int main()
{
  int n,l,f,m;
  double k;
  int i,j,p;
  scanf("%d",&n);
  for(p=6;p<=n;p+=2)
  {
    l=p/2;
    for(i=3;i<=l;i+=2)
       if(ss(i)&&ss(p-i))
       {
       printf("%d=%d+%d\n",p,i,p-i);
       break;
       }
  }
    return 0;
}
void main()
{
	unsigned i,n;
	int checkN(unsigned);
	scanf("%u",&n);
	for(i=6; i<=n; i+=2)
	{
		unsigned j=0;
		for(j=3; j<=i-3;j++)
		{
			if(checkN(j) && checkN(i-j))
			{
				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()
{
	int n,k,i,l,j,a,b;
	float r;
	scanf("%d",&n);
    for(k=6;k<=n;k=k+2)/*?n???????k,??*/ 
	{
		for(i=3;i<=k;i=i+2)/*????i?????*/
		{
			a=0;
			b=0;
			for(j=3;j<=sqrt(i);j=j+2)
			{
				r=i%j;
				if(r==0)
				 a=1;
			}
			if(a==0)/*?i?????*/
			{
				l=k-i;
				for(j=3;j<=sqrt(l);j=j+2)/*????l?????*/
				{	
					r=l%j;
	        		if(r==0)
						b=1;
				}
				if(b==0)/*?l??????*/
				{
					printf("%d=%d+%d\n",k,i,l);
					break;
				}
				a=0;
				b=0;
			}
		}
	}
}
/* ????????????????????????i????????? */

/* ?IDX(i)????i?????????? */

/* ?OFF(i)????i????????????????? */

/* ????i??????????1??i????? */

/* ???i????????0???i????? */

int main()
{
    int n, i, j;
    unsigned int *isprimebits;    /* ?????????????? */
    scanf("%d", &n);
    
    /* ????????????1??????????? */
    isprimebits = (unsigned int *)
                  malloc((IDX(n) + 1) * sizeof(unsigned int));
    
    /* ????????????????1 */
    memset(isprimebits, -1, (IDX(n) + 1) * sizeof(unsigned int));
    
    /* ????????????????????????? */
    for (i = 3; i <= n/2; i += 2) {
        if (ISPRIME(i)) {
            /* ?? i ????(j)??????????????? */
            for (j = 3 * i; j <= n; j += 2 * i) {
                CLEARPRIME(j);
            }
        }
    }
    
    /* 3?n????????????????????? */
    for (i = 6; i <= n; i += 2) {
        for (j = 3; j <= i / 2; j += 2) {      /* ??????j?i-j */
            if (ISPRIME(j) && ISPRIME(i-j)) {
                printf("%d=%d+%d\n", i, j, i - j);
                break;
            }
        }
    }
    
    free(isprimebits);         /* ???????? */
    return 0;
}
int prime (int a)
{
	int i,j;
	if (a==3||a==5||a==7)
	{
		return 1;
	}
	else
	{
		for (i=3;i<=sqrt(a);i+=2)
		{
			if (a%i==0)
			{
				return 0;
				break;
			}
		}
		return 1;
	}
}
int main()
{
	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 sushu(int a)
{
	int i = 1;
	int j = 0;
	for(i = 1;i <= (int)sqrt(a);i = i + 2)
	{
		if((int)(a / i) * i == a)
		{
			j++;
		}
	}
	if(j == 1)
		return 1;
	else 
		return 0;
}

int main()
{
	int sushu(int a);
	int n ;
	scanf("%d",&n);
	int b = 6;
	int k;
	for(b = 6;b <= n;b = b + 2)
	{
		for(k = 3;k <= (int)(b / 2);k = k + 2)
		{
			if(sushu(k) == 1 && sushu(b-k) == 1)
			{
				printf("%d=%d+%d\n",b,k,b-k);
				break;
			}
		}
		k = 3;
	}
return 0;
}
void main()
{
    int a[50001],i,j,n;
	a[3]=a[5]=a[7]=1;
	a[4]=a[6]=a[8]=0;
	scanf("%d",&n);
	for(i=9;i<=50000;i++)
		a[i]=1;
	for(i=9;i<=50000;i++)
	{
	    if(i%2==0) a[i]=0;
		else if(i%3==0) a[i]=0;
		else if(i%5==0) a[i]=0;
		else if(i%7==0) a[i]=0;
		else 
			for(j=11;j<=sqrt(i);j++)
			{
			   if(i%j==0)
			   {
			   a[i]=0;
			   break;
			   }
			}
	}
   for(j=6;j<=n;j=j+2)
   {
	for(i=3;i<=j/2;i=i+2)
	{
	  if(a[i]==1&&a[j-i]==1)
	  {
		  printf("%d=%d+%d\n",j,i,j-i);
	  break;
	  }
	}
   }
}
void main()
{ 
 long n,k,i,p;
 scanf("%ld",&n);
 int s[50001]={0};
 s[5]=1;s[3]=1;
 for (i=7;i<=n;)
 {p=0;
  for (k=3;k<=sqrt(i);k=k+2)
	  if (i%k==0) {p=1;break;}
  if (p==0) s[i]=1;
  i=i+2;
 }
 for (i=6;i<=n;)
 {k=3;
  while (k<=i/2)
   if (s[k]==1&&s[i-k]==1) {printf("%ld=%ld+%ld\n",i,k,i-k); break;} else k=k+2;
   i=i+2;
 }
}
main()
{
	int m,a,b,c,d,e;
	scanf("%d", &m);
	printf("6=3+3\n8=3+5\n10=3+7\n12=5+7\n");
	for (a=14;a<=m;a=a+2)
	{
		for(b=3;b<a;b=b+2)
		{
			d=a-b;
			for (c=3;c<sqrt(b);c=c+2)
				if (b%c==0) break;
			for (e=3;e<sqrt(d);e=e+2)
			    if (d%e==0) break;
			
            if (c>sqrt(b))
			{
				if (e>sqrt(d)) break;
			}
		}
	    printf("%d=%d+%d\n", a, b, d);
	}
}
int main()
{   int prime(int n);
    int n;
    scanf("%d", &n);
    int i,j;
    for(i=6;i<=n;i=i+2)
    {
                      for(j=3;j<=n/2;j=j+2)
                      {
                                         if(prime(j)==1&&prime(i-j)==1)
                                         {
                                               printf("%d=%d+%d\n", i, j, i-j);
                                               break;
                                         }
                      }
    }
    return 0;
}
                                               
                                         
                                         
                                         
                                         
            int prime(int n)
    {
        int i;
        int flag=0;
        for(i=2;i<=sqrt(n);i++)
        {
                               if(n%i==0)
                               {
                                         flag++;
                                         break;
                               }
        }    
        if(flag==1)
        {
        return 0;
        }
        else
        {
        return 1;
        }
}
int sushu(int n)
 {  int a;
    if(n==2)
	return(0);
	else if(n>2)
	{ 
	  for(a=2;a<=sqrt(n);a++)
	    {  if(n%a==0)
		   break;
		}
	  if(a>sqrt(n))
	  return(0);
	  else 
	  return(1);
	}
}
void main()
{
  int n,a,b,c,d;
  scanf("%d",&n);
  for(a=6;a<=n;a=a+2)
    {
	  for(b=2;b<a;b++)
	  { 
	    c=sushu(b);
		d=sushu(a-b);
		if(c==0&&d==0)
	    {	printf("%d=%d+%d\n",a,b,a-b);
		break;}
	   }
	 }
}
int main()
{
    int p[50001];
    int n,i,j,count=1;
    scanf("%d",&n);
    
    for(i=1;i<=n;i++)
    {
                    p[i]=1;
    }
    for(i=2;i<=n/2;i++)
    {
     if (p[i])
     {
      for(j=i+i;j<=n;j+=i)
      {
                          p[j]=0;                       
      }
     }
     }
    
    for(i=6;i<=n;i+=2)
    {
                      for (j=2;j<=n/2;j++)
                      if (p[j]&&p[i-j])
                      {printf("%d=%d+%d\n",i,j,i-j);break;}
    }
    
}
int main()
{
	int i,j,k,n,d,x,e,a1,a2,a3;
        scanf("%d",&n);a1=floor(n/2);
         for (i=6;i<=n;i++)
		if (i%2==0)
           for (j=2;j<=a1;j++)
		   { 
             d=0;x=0;a2=floor(sqrt(j));
             if ((j>2)&&(j%2==0)) d=1;
             else
                for (k=2;k<=a2;k++)
                   if (j%k==0) d=1;
                         x=i-j;
                         a3=floor(sqrt(x));
                         if (d==0)
                         if ((x>2)&&(x%2==0)) d=1;
                         else
                         for (k=2;k<=a3;k++)
                           if (x%k==0) d=1;
                       if (d==0){ 
                  printf("%d=%d+%d\n",i,j,x);
                      break;

                }
       }
		   return 0;
}
int main()
{
	int a(int n);
	int i,j,z;
	scanf("%d",&z);
    for(i=6;i<=z;i=i+2)
		for(j=3;j<=i-j;j=j+2)
			if(a(j)&&a(i-j))
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
			return 0;
}
int a(int n)
{
	int k;
	for(k=3;k<=sqrt(n);k=k+2)
		if(n%k==0)
			return (0);
		return (1);
}
int main(int argc, char* argv[])
{
	int a[30000] = {0}, n, i, j, k, temp, b=0 ;
	scanf("%d",&n);
	for (i = 3; i <= n; i++)
	{
		for (j = 2; j <= sqrt(i); j++)
		{
			if (i % j == 0) break;
			else continue;
		}
		if (j > sqrt(i))
		{
			a[b] = i;
			b++;
		}
	}
	b--;
	for (i = 6; i <= n; i += 2)
	{
		temp = 0;
		for (j = 0; j <= b; j++)
		{
			for (k = 0; k <= b; k++)
				if (i - a[j] == a[k])
				{
					temp = 1;
					break;
				}
			if (temp)
				break;
		}
		if (temp)
			printf("%d=%d+%d\n",i,a[j],a[k]); 
	}
	return 0;
}
int main()
{
	int check(double x,double y);//??????x?y?????
	int n,a=0,b=0,answer;
    scanf("%d",&n);
	int k=6;
	while(k<=n)//k???6~n???
	{
		int i=2;
		while(i<=k/2)
		{
			a=i;
			b=k-i;
			answer=check(a,b);
			if(answer==1)//answer??1?????
			{
				printf("%d=%d+%d\n",k,a,b);//????
				break;
			}
			else
				if(i==2)
					i=i+1;
				else
					i=i+2;
		}
		k=k+2;
	}
}

int check(double x,double y)
{
	int d1=0,d2=0;
	int i=2;
	int answer;
	while(i<=sqrt(x))
	{
		if((int)x%i==0)
		{
			d1=1;
			break;
		}
		else
			i++;
	}//????x?????
	i=2;
	while(i<=sqrt(y))
	{
		if((int)y%i==0)
		{
			d2=1;
			break;
		}
		else
			i++;
	}//????y?????
	if(d1==0&&d2==0)
		answer=1;
	else
		answer=0;
	return answer;//??x???d1=0?y????d2=0?????0????1?????0
}
void main()
{
	int s(int x);
	int a,n,m;
	scanf("%d",&m);
	if(m<=50000)
	{
    for(n=6;n<=m;n=n+2)
	{
		for(a=3;a<=n/2;a=a+2)
			if(s(a)+s(n-a)==2)
				break;
	printf("%d=%d+%d\n",n,a,n-a);
	}
	}
              
}

int s(int x)
{
	int i;
	for(i=3;i<=x/2;i=i+2)
		if(x%i==0)
			break;
	if(i>x/2)
		return(1);
	else
		return(0);
}
int main()
{
	int prime(int);
	int i,n,h;
	scanf("%d",&n);
	for(h=6;h<(n+1);h=h+2)
    {for(i=3;i<=(h/2);i++)
	{
		if(prime(i)==1&&prime(h-i)==1)
		{	printf("%d=%d+%d\n",h,i,h-i);
		break;
		}
	}
    }
	return 0;
}

	int prime(int n)
	{ int i,flag=1;
	for(i=2;i*i<=n&&flag==1;i++)
	{if(n%i==0)
	flag=0;}
	return(flag);}
int main()
{
	int i,k,s,a,n,b,c;
	
	int count=0;
	scanf("%d",&s);
	for(i=6;i<=s;i++)
	{
		if(i%2==0)
		{
			a=i;
		for(n=2;n<=a/2;n++)
		  {
             c=(int)(sqrt(n));
			    for(k=2;k<=c;k++)
				{
				  if(n%k==0)
					 break; 
				}
				if(k>c){
					  b=a-n;							    				  			  
              			      for(k=2;k<=(sqrt(b));k++)
				  {
				  if(b%k==0)
					  break;
				  }
				  if(k>((int)(sqrt(b)))){
                   printf("%d=%d+%d\n",a,n,b);
					  break;
				  }
				} 				  				
		  }
		}
	}	 	
	return 0;
}
int main()
{
	int n,i,t,m,p,q;
	scanf("%d",&n);
	for(i=6;i<=n;i++)
	{
		if(i%2!=0)
			continue;
		else
		{
			for(t=3;t<=i/2;t++)
			{
				p=0;
				q=0;
				for(m=2;m<=sqrt(t);m++)
				{
					if(t%m==0)
					{
						p=1;
						break;
					}
					else
						continue;
				}
				for(m=2;m<=sqrt(i-t);m++)
				{
					if((i-t)%m==0)
					{
						q=1;
						break;
					}
					else
						continue;
				}
				if(p==0&&q==0)
				{
					printf("%d=%d+%d\n",i,t,i-t);
					break;
				}
				else
					continue;
			}
		}
	}
	return 0;
}
int P[250]={0};
void prime(int n)
{
    int i;
    for (i=1;P[i]*P[i]<=n;i++)
        if (n%P[i]==0)
           return;
    P[0]++;
    P[P[0]]=n;
}
int p(int n)
{
    int i;
    for (i=1;P[i]*P[i]<=n;i++)
        if (n%P[i]==0)
           return 0;
    return 1;
}
int main()
{
    int n,i,j;
    P[0]=1;
    P[1]=2;
    for (i=3;i<250;i++)
        prime(i);
    scanf("%d",&n);
    for (j=6;j<=n;j+=2)
        for (i=3;i<=j/2;i++)
            if (p(i) && p(j-i))
            {
               printf("%d=%d+%d\n",j,i,j-i);
               break;
            }
    getchar();
    getchar();
    return 0;
}
void main()
{
	int n,i=6,a,d,m,p,q,r,s;
	scanf("%d",&n);
	for(;i<=n;i=i+2)
	{
		
		for(a=3;a<=i/2;a=a+2)
		{
			m=a;
			d=i-a;
			r=0;s=0;
			for(p=3;p<=(m/2);p=p+2)
			if(m%p==0) r=1;
				
			for(q=3;q<=(sqrt(d));q=q+2)
			if(d%q==0) s=1;
				

			if(r==0&&s==0)break;
		}
		printf("%d=%d+%d\n",i,m,d);
	}
}
int main()
{
	int p(int x);
	int n,i,m;
	scanf("%d",&n);
	for(m=6;m<=n;m=m+2)
    for(i=3;i<=m/2;i++)
		if(p(i)==1&&p(m-i)==1)
		{
		printf("%d=%d+%d\n",m,i,m-i);
		break;
		}
	return 0;
}
    int p(int x)
	{
       int k,i,c;
	   k=(int)sqrt(x);
	   for(i=2;i<=k;i++)
		   if(x%i==0)break;
	   if(i>k)
		   c=1;
	   else
		   c=0;
	   return c;
	}
int main()
{
	int i,j,k,n,b,x,c,a1,a2,a3;
	scanf("%d",&n);
	a1=(int)(n/2);
	for (i=6;i<=n;i++)
		if (i%2==0)     
			for (j=2;j<=a1;j++)      
			{       
				b=0;
				x=0;
				a2=(int)(sqrt(j));
				if ((j>2)&&(j%2==0))
					b=1;
				else           
					for (k=2;k<=a2;k++)
						if (j%k==0)
							b=1;
							x=i-j;
							a3=(int)(sqrt(x));
						if (b==0)
							if ((x>2)&&(x%2==0)) 
								b=1;
							else
								for (k=2;k<=a3;k++)
									if (x%k==0)
										b=1;
									if (b==0)
									{          
										printf("%d=%d+%d\n",i,j,x);
										break;
									}
			}
	return 0;
}
int a(int n)
{
int i,j,m,q=0;
if (n%2==0&&n!=2) q=1;
m=sqrt(n);
for(i=3;i<=m;i+=2)
{
if (n%i==0) q=1;
}
return(q);
}

int main()
{
int n,i,j;
scanf("%d",&n);
for(i=6;i<=n;i+=2)
{
for(j=2;j<n;j++)
{
if(a(j)==0&&a(i-j)==0) 
{printf("%d=%d+%d\n",i,j,i-j);
break;}
}
}
}
int isprime(int a)
{
	int i,sqrta;
	if(a%2==0) return 0;
	sqrta=(int)sqrt(a);
	for(i=3;i<=sqrta;i+=2)
	{
		if(a%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+=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 su(int x)
{
	int m;
	if(x==2)
	{
		return 1;
	}
	else if(x%2==0)
	{
		return 0;
	}
	else
	{
	for(m=2;m*m<=x;m++)
	{
		if(x%m==0)
			return 0;
	}
	return 1;
	}
}

int main()
{
	int i,j,n,k;
	scanf("%d",&n);
	if(n%2==0)
	{
		for(i=6;i<=n;i+=2) 
		{
			for(j=3;j<=i/2;j++)
			{
				if(su(j))
				{
					k=i-j;
					if(su(k))
					{
						printf("%d=%d+%d\n",i,j,k);
						break;
					}
				}
			}
		}
	}
	else
	{
		for(i=6;i<n;i+=2)
		{
			for(j=2;j<i;j++)
			{
				if(su(j))
				{
					k=i-j;
					if(su(k))
					{
						printf("%d=%d+%d\n",i,j,k);
						break;
					}
				}
			}

		}
	}
	return 0;
}
int prime(int a)
{
	int p=1;
	for(int i=2;i<=sqrt(a);i++)
	{
		if(a%i==0)
			p=0;
	}
	return p;
}
int main()
{
	int n,i,k,a,b;
	scanf("%d",&n);
	printf("6=3+3");
	for (i=8;i<=n;i=i+2)
	{
		for (k=3;;k=k+2)
		{
			a=prime(k);
			b=prime(i-k);
			if (a==1&&b==1)
			{
				printf("\n%d=%d+%d",i,k,(i-k));
				break;
			}
		}
	}
}
void main()
{
      long n,a,b,y1,y2,i,j;
      scanf("%ld",&n);
      for(i=6;i<=n;i=i+2)
      {     
            for (a=3;a<=i-3;a=a+2)  
               {  b=i-a;
                       if(a%2==0)    y1=0; 
                       else
                           {
                             y1=1;
                             for(j=3;j<=sqrt(a);j=j+2)
                             if (a%j==0) {y1=0;break;}
                              
                           }
                       
                       
                       if(b%2==0)    y2=0;
                       else 
                           { 
                             y2=1;
                             for(j=3;j<=sqrt(b);j=j+2)
                             if (b%j==0) {y2=0;break;}
                             
                           }               
                       if (y1*y2==1)  
                             {printf("%ld=%ld+%ld\n",i,a,b);break;}
               }
                       
      }
      
}
int main()
{
    int a[50000]={0};
    long d[5134];
    long i,j,x,n;
    for (i=2;i<=49999;i++)
    if (a[i]==0)
    {
      x=sqrt(i);
      for (j=2;j<=x;j++)
       if (i%j==0) break;
      if (j>x) {n=2;while (n*j<=50000){a[n*j]=1;n=n+1;}}
        }
    x=0;
    for (i=2;i<=49999;i++)
     if (a[i]==0) {x=x+1;d[x]=i;}
    scanf("%ld",&n);
    for (i=6;i<=n;)
    {
       for (j=1;j<=x;j++)
       if (a[i-d[j]]==0) {printf("%ld=%ld+%ld\n",i,d[j],i-d[j]);break;}
     i=i+2;   }
    }
void main()
{
	int I,i,n,j,k,s,a,x;
	int p,q;
	scanf("%d",&a);
	for(n=6;n<=a;n=n+2)
	{   x=0;
		s=n/2;
		for(i=3;i<=s;i=i+2)
		{
			p=sqrt(i);
			for(j=2;j<=p;j++)        
			{
				if(i%j==0)  break;   
			}
			I=n-i;
			q=sqrt(I);
			for(k=2;k<=q;k++)
			{
				if(I%k==0)   break;
			}
			if ((j>=p+1)&&(k>=q+1))
			{
				  printf("%d=%d+%d\n",n,i,I);break;
			}
	
		}
	}
}
int number[50000]; 
int check(int x)
{
	if(x==3)return 1;
	for(int y=3;y<x;y=y+2)if(x%y==0)return 0;
	return 1;
}
int main()
{
	int n,i,j,k;
	scanf("%d",&n);
	for(i=3;i<n;i+=2)
	{
		number[i]=check(i);
	}
	for(i=6;i<=n;i+=2)
	{
		for(j=3;j<=i/2;j+=2)
		{
			if(number[j]==1&&number[i-j]==1)
			{
				printf("%d=%d+%d\n",i,j,i-j);
				break;
			}
		}	
	}
}
int main()
{
	int n,i,j,k,m,q,p;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2)
	{
		for(m=3;m<i-2;m++)
		{
			p=sqrt(m);q=sqrt(i-m);
			for(j=2;j<=p;j++)
			if(m%j==0)break;
			for(k=2;k<=q;k++)
			if((i-m)%k==0)break;
			if(j==(p+1)&&k==(q+1))break;
		}
		printf("%d=%d+%d\n",i,m,i-m);
	}
}
main()
{ unsigned n,i,k,m,t;
scanf("%d",&n);          
for(i=6;i<=n;i=i+2)
{ for(k=3;k<=i/2;k=k+2)  
 {  m=i-k;
    for(t=3;t<=sqrt(k);t=t+2)
	 if(k%t==0)
		 break;
 if(t>sqrt(k))                      
 {	 for(t=3;t<=sqrt(m);t=t+2)    
	if(m%t==0)
	  break;
	if(t>sqrt(m))
	{   printf("%d=%d+%d\n",i,k,m);
	break;
	}
 }
 }

}



}
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;
		  }
		  if (aa=='y')
		  {
		  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 main()
{
	int n,i;
	scanf("%d",&n);
	for(i=6;i<=n;i=i+2){
		int k,p;
		for(k=3;k<=i/2;k=k+2){
			p=i-k;
			int a,b,c,d;
			c=(int)sqrt(k+1);
			d=(int)sqrt(p+1);
            for(a=2;a<=c;a++){
				if(k%a==0)
					break;
			}
			for(b=2;b<=d;b++){
				if(p%b==0)
					break;
			}
			if(a>=c+1&&b>=d+1){
				printf("%d=%d+%d\n",i,k,p);
                                     break;
			}
		}
	}
		return 0;
}