#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using vi = vector<int>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"

constexpr int MOD = 1000000007;
const int INF = 1 << 30;

int func_v(int n) {
    map<int, int> m;

    int t = n;

    int i = 2;
    while (i * i <= n) {
        if (n % i == 0) {
            m[i]++;
            n /= i;
        }
        else {
            i++;
        }
    }
    if (n > 1) m[n]++;

    int res = 1;

    for (auto&& p : m) {
        res *= p.second + 1;
    }

    return t - res;
}

int main() {
    int x;
    cin >> x;

    int o = x / 2;

    vector<pint> res;

    int m = INF;

    for (int a = max(1, o - 1000); a <= min(o + 1000, x-1); a++) {
        int b = x - a;
        int fa = func_v(a);
        int fb = func_v(b);
        m = min(m, abs(fa - fb));
    }

    for (int a = max(1, o - 1000); a <= min(o + 1000, x-1); a++) {
        int b = x - a;
        int fa = func_v(a);
        int fb = func_v(b);
        if (abs(fa - fb) == m) {
            res.push_back(make_pair(a, b));
        }
    }

    sort(all(res));

    int s = res.size();

    rep(i, s) cout << res[i].first << " " << res[i].second << endl;
    return 0;
}