#include <bits/stdc++.h>
using namespace std;
bool isP(int x)
{
    if (x < 2)
        return false;
    for (int i = 2; i * i <= x; i++)
        if (x % i == 0)
            return false;
    return true;
}
int main()
{
    for (int i = 6; i <= 100; i += 2)
    {
        //找到 i 拆分的方案
        for (int j = 2; j <= i / 2; j++)//现在的方案是 j+(i-j) == i
            if (isP(j) && isP(i - j))
            {
                cout << i << "=" << j << "+" << i - j << "\n";
                break;
            }
    }
    return 0;
}