448.cpp

#include <iostream>

bool is_prime(int n) {
    for (int i = 2; i * i <= n; ++i)
        if (n % i == 0) {
            return false;
        }
    return n > 1;
}

int main() {
    std::cin.tie(0);
    std::cout.tie(0);

    std::ios_base::sync_with_stdio(false);


    int n;
    std::cin >> n;

    if (n % 2 == 1) {
        --n;
    }

    while (n > 0) {
        for (int p = n+1; p < n+n; p += 2)
            if (is_prime(p)) {
                int left = p-n;
                int right = n;
                n = left-1;
                while (left < right) {
                    std::cout << left << " " << right << std::endl;
                    ++left;
                    --right;
                }
                break;
            }
    }

    return 0;
}