#include <bits/stdc++.h>
using namespace std;
using lint     = long long;
const lint inf = 1LL << 60;
const lint mod = 1000000007;

// list up all factors
template <typename T>
set<T> factors(T a) {
    set<T> facs;
    for (T i = 1; i * i <= a; ++i) {
        if (a % i == 0) {
            facs.insert(i);
            facs.insert(a / i);
        }
    }
    return facs;
}

template <class T>
bool chmax(T &a, const T &b) {
    return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
    return (b < a) ? (a = b, 1) : 0;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    lint x;
    cin >> x;
    vector<lint> f(x + 1);
    for (int i = max(1LL, x / 2 - 1000); i < min(x, x / 2 + 1000); ++i) {
        f[i] = i - factors(i).size();
    }
    vector<pair<int, int>> ret;
    lint mini = inf;
    for (int i = max(1LL, x / 2 - 1000); i < min(x, x / 2 + 1000); ++i) {
        chmin(mini, abs(f[i] - f[x - i]));
    }
    for (int i = max(1LL, x / 2 - 1000); i < min(x, x / 2 + 1000); ++i) {
        if (abs(f[i] - f[x - i]) == mini)
            ret.emplace_back(i, x - i);
    }
    for (auto &r : ret) {
        cout << r.first << " " << r.second << "\n";
    }
    return 0;
}