#include<stdio.h>

int isprime(int);
int main()
{

	int primes[]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
	int k=15,i,j;


	for(i=2;i<=25;i++)
	{
		for(j=0;j<15;j++)
		{
			if(2*i>primes[j])
			{
				if(isprime(2*i-primes[j]))
				{
					if(2*i-primes[j]!=1)
					printf(" \n%d can be expressed as %d + %d ",2*i,primes[j],2*i-primes[j]);
					break;				
				}
			}
		
			
		}
	}
	return 0;
}

int isprime(int n)
{

	int i,count=0;
	for(i=2;i<n;i++)
	{
		if(n%i==0)
		count++;
	}
	if(count==0)
	return 1;
	else
	return 0;
}