#include<stdio.h>
#include<math.h>
int isprime(int x)
{
	for(int i = 2 ;i <= sqrt(x);i++)
	{
		if(x % i == 0)
		return 0;
	}
	return 1;
}
 int n,t,j = 0,a[1200] = {0},b[50005][5] = {0};
int main()
{
	
	scanf("%d",&n);
	for(int i = 2 ;i <= n;i++)
	{
		
		if(isprime(i))
		{	
			j++;
			a[j] = i;
		}
	}
	j = 1;
	int k = 1;
	for(int i = 1;2*i + 2 <= n;i++)
	{	
		for(int k = 1  ;k  <= sqrt(n);k++ )
		{	
			 t = 2*i+2 - a[k];
			if( isprime(t))
			{
				b[j][1] = 2 * i + 2;
				b[j][2] = a[k];
				b[j][3] = t;
				j++;
				goto gg;
			}
			
		}
		gg:
			j = j;
	}
	j--;
	for(int i = 1;i <= j;i++)
	{
		printf("%d=%d+%d\n",b[i][1],b[i][2],b[i][3]);
	}
	return 0;
}