// Program 83: Goldbach Number

import java.util.*;
class GoldbachNumber {
    static boolean prime(int n) {
        if (n < 2) {
            return false;
        }
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            return false;
        }
}
return true;
}
public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    if (n <= 4 || n % 2 != 0) {
        System.out.println("INVALID INPUT");
        return;
    }
boolean found = false;
for (int p = 3; p <= n / 2; p += 2) {
    if (prime(p) && prime(n - p)) {
    }
System.out.println(p + " + " + (n - p));
found = true;
}
if (!found) {
    System.out.println("NO PRIME PAIR FOUND");
}
}
}