UVa 543

#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 scs(s)              scanf("%s",s)
#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]=0;
    chk[1]=1;
    for(int i=2;i<=1000000;i++){
        if(chk[i]==1)
            continue;
        if(i==2) chk[i]=1;
        else prime.pb(i);
        for(int j=2;i*j<=1000000;j++){
            chk[i*j]=1;
        }
    }
}

int main()
{
    seive();
    int n;
    while(1){
        sci(n);
        if(n==0) break;
        int x,y,i=0;
        while(prime[i]<=n/2){
            x=prime[i];
            y=n-prime[i];
            if(chk[y]==0)
                break;
            i++;
        }
        pfi(n);
        pf(" = ");
        pfi(x);spc;pf("+");spc;pfi(y);line;
    }
    return 0;
}