UVa 10948

#include<bits/stdc++.h>
using namespace std;

typedef long long int       ll;
typedef unsigned long long int  ull;
typedef vector<int>         vi;
typedef vector<ll>          vll;
typedef vector<vi>          vvi;
typedef pair<int,int >      pii;
typedef vector< pii >       vpii;
typedef set<int>            sti;

#define sc                  scanf
#define pf                  printf
#define sci(n)              scanf("%d",&n)
#define scl(n)              scanf("%lld",&n)
#define scf(n)              scanf("%lf",&n)
#define pfi(n)              printf("%d",n)
#define pfl(n)              printf("%lld",n)
#define pff(n)              cout<<n
#define line                printf("\n")
#define spc                 printf(" ")
#define loop(i,x,y)         for(int i=int(x); i<=int(y); i++)
#define rloop(i,y,x)        for(int i=int(y); i>=int(x); i--)
#define cspf(i)             printf("Case %d: ", i)
#define pb                  push_back
#define mp                  make_pair
#define ff                  first
#define ss                  second
#define all(v)              v.begin(),v.end()
#define rall(v)             v.rbegin(),v.rend()
#define read()              freopen("input.txt", "r", stdin)
#define write()             freopen("output.txt", "w", stdout)
/// Constants
#define eps                 1e-9
#define PI                  acos(-1.0)  // 3.1415926535897932

vi prime,chk(1000009);

void seive(){
    chk[0]=1;
    chk[1]=1;
    prime.pb(0);
    for(int i=2;i<=1000000;i++){
        if(chk[i]==1)
            continue;
        prime.pb(i);
        for(int j=2;i*j<=1000000;j++){
            chk[i*j]=1;
        }
    }
    /*int sz=prime.size();
    loop(i,1,100){
        cspf(i);
        pfi(prime[i]);
        line;
    }*/
}


int main()
{
    seive();
    read();
    write();
    int n;
    while(1){
        int x,y,flg=0;
        sci(n);
        if(n==0)
            break;
        for(int i=1;prime[i]<=n/2;i++){
            int dff=n-prime[i];
            if(chk[dff]==1)
                continue;
            x=prime[i];
            y=dff;
            flg=1;
            break;
        }
        if(flg)
            pf("%d:\n%d+%d\n",n,x,y);
        else
            pf("%d:\nNO WAY!\n",n);
    }
    return 0;
}