import java.util.Scanner;

/**
 * Goldbach’s Conjecture
 */
public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNextInt()) {
            int num = sc.nextInt();
            if (num == 0) {
                break;
            }

            for (int i = 2; i < num; i++){
                if (isPrime(i)){
                    int secondPrime = num - i;
                    if (isPrime(secondPrime)) {
                        System.out.printf("%d = %d + %d\n", num, i, secondPrime);
                        break;
                    }
                }
            }
        }
    }

    public static boolean isPrime(int num) {
        if (num < 2) return false;
        if (num == 2) return true;
        if (num % 2 == 0) return false;
        for (int i = 3; i * i <= num; i += 2)
            if (num % i == 0) return false;
        return true;
    }
}