#include <stdio.h>
int prime(int n){
    int i=2;
    if(n==i) return 1;
    while(i*i<=n){
        if(n%i==0) return 0;
        i++;
    }
    return 1;
}
int goldbach(int n){
    int i=2;
    while(i<=n/2){
        if(prime(i)&&prime(n-i)) return i;
        i++;
    }
    return -1;
}
int main(){
    int n=4;
    while(n<=100){
        if(goldbach(n==-1))
        printf("%d=%d+%d\n",n,goldbach(n),n-goldbach(n));
        n+=2;
    }
}