#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
template<typename T> void print(T a) { cout << a << '\n'; }
template<typename T, typename... Ts> void print(T a, Ts... ts) { cout << a << ' '; print(ts...); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

class Eratosthenes {
    vector<int> plist;

public:
    Eratosthenes(int sz) : plist(sz, -1) {
        for (int i = 2; i < sz; i++) {
            if (plist[i] == -1) {
                for (int j = i; j < sz; j += i) {
                    if (plist[j] == -1) {
                        plist[j] = i;
                    }
                }
            }
        }
    }
    bool isPrime(int n) {
        return plist[n] == n;
    }
    vector<int> factor(int n) {
        vector<int> res;
        while (n > 1) {
            res.push_back(plist[n]);
            n /= plist[n];
        }
        return res;
    }
};

int cnt(vector<int> &&factor) {
    int len = 0, prev = 0;
    int ans = 1;
    for (auto f : factor) {
        if (f == prev) {
            len++;
        } else {
            ans *= (len + 1);
            len = 1;
        }
        prev = f;
    }
    ans *= (len + 1);
    return ans;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin, n;

    Eratosthenes prime(n + 1);
    const int inf = 1 << 30;
    vector<int> ans(n, inf);
    rep(a, 1, n) {
        int b = n - a;
        int fa = a - cnt(prime.factor(a));
        int fb = b - cnt(prime.factor(b));
        ans[a] = abs(fa - fb);
    }
    int mn = *min_element(ans.begin(), ans.end());
    rep(i, 1, n) {
        if (mn == ans[i]) {
            print(i, n - i);
        }
    }
    return 0;
}