package cn.itcast.girl.TheBlueCup_02;
import java.util.Scanner;
public class GoldbachConjecture {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for(int i=4;i<=n;i+=2) {
for(int j=2;j<i;j++) {
if(prime(j) && prime(i-j)) {
System.out.println(i+"="+j+"+"+(i-j));
break;
}
}
}
sc.close();
}
public static boolean prime(int n) {
for(int i=2;i<=n/2;i++) {
if(n%i==0)return false;
}
return true;
}
}