#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int x;
    cin >> x;

    vector<int> is_prime(x, true);
    is_prime[0] = is_prime[1] = false;
    vector<int> min_fac(x, x);
    min_fac[0] = 0;
    min_fac[1] = 1;
    for (int i = 2; i < x; ++i) {
        if (!is_prime[i]) continue;
        min_fac[i] = i;
        for (int j = 2 * i; j < x; j += i) {
            is_prime[j] = false;
            if (min_fac[j] > i) min_fac[j] = i;
        }
    }

    vector<int> fs(x, 1);
    for (int i = 1; i < x; ++i) {
        int tmp = 1;
        int cur = i;
        int fac = 1;
        while (cur > 1) {
            if (min_fac[cur] == fac) {
                ++tmp;
            } else {
                fs[i] *= tmp;
                fac = min_fac[cur];
                tmp = 2;
            }
            cur /= min_fac[cur];
        }
        fs[i] *= tmp;
        fs[i] = i - fs[i];
    }

    int cnt = 1e9;
    vector<int> as;
    for (int a = 1; a < x; ++a) {
        int val = abs(fs[a] - fs[x - a]);
        if (val < cnt) {
            cnt = val;
            as.clear();
            as.push_back(a);
        } else if (val == cnt) {
            as.push_back(a);
        }
    }

    for (int a : as) {
        cout << a << " " << x - a << "\n";
    }
    return 0;
}