#include <stdio.h>
#include <math.h>
int isPrime(int num) {
    if (num < 2) {
        return 0;
    }
    int limit = sqrt(num);
    for (int i = 2; i <= limit; i++) {
        if (num % i == 0) {
            return 0;
        }
    }
    return 1;
}
int main() {
    int N;
    scanf("%d", &N);
    for (int i = 4; i <= N; i += 2) {
        for (int j = 2; j <= i / 2; j++) {
            int k = i - j;
            if (isPrime(j) && isPrime(k)) {
                printf("%d = %d + %d\n", i, j, k);
                break;
            }
        }
    }
    return 0;
}