#include <stdio.h>
int s[1500];
int primecheck(int n)
{
	if (n == 2)
		return 1;
	for (int a = 2; a <= n - 1; a++)
	{
		if (n % a == 0)
			return 0;
	}
	return 1;
}
void prime(void)
{
	int c = 0;
	for (int b = 2; b <= 10000; b++)
	{
		if (primecheck(b))
		{
			s[c] = b;
			c = c + 1;
		}
	}
}
int main()
{
	prime();
	int d = 0;
	int h = 0;
	int f;
	int j;
	scanf("%d", &f);
	for (int e = 4; e <= f; e = e + 2)
	{
		for (int g = s[d]; g <= e; d++)
		{
			g = s[d];
			for (int i = s[h]; i <= e; h++)
			{
				i = s[h];
				if (s[d] + s[h] == e && d <= h)
				{
					printf("%d=%d+%d\n", e, s[d], s[h]);
					break;
				}
			}
			if (s[d] + s[h] == e)
			{
				h = 0;
				d = 0;
				break;
			}
			h = 0;
		}
		d = 0;
	}

}