#include <stdio.h>
int isprime(int n);
int main()
{
    int m,n;

for (n = 6;n <= 200; n +=2)
{
    for ( m = 3; m <= n/2 ;m += 2)
    {
        if (isprime(m) && isprime(n - m))
        {
            printf("%d = %d + %d\n",n,m,n - m);
            break;
        }
    }
}
return 0;
}

int isprime(int n)
{
    int m = 2;
    for (; m * m < n ; ++m)
    {
        if (n % m == 0)return 0;
    }
        return 1;
}