#include <bits/stdc++.h>
using namespace std;

template<class INT>
std::vector<INT> get_min_prime_fact_table(INT n){
    std::vector<INT> lp(n + 1), P;
    for (INT i = 2; i <= n; i++){
        if (lp[i] == 0){
            lp[i] = i;
            P.push_back(i);
        }
        for (INT j = 0; j <= P.size() and P[j] <= lp[i] and i * P[j] <= n; j++)
            lp[i * P[j]] = P[j];
    }

    return lp;
}

template<class INT>
std::map<INT, int> prime_factorize(INT n, std::vector<INT>& lp){
    std::map<INT, int> res;
    while (n != 1){
        res[lp[n]]++;
        n /= lp[n];
    }

    return res;
}

int main(){
    int x;
    cin >> x;
    auto lp = get_min_prime_fact_table(x);
    vector<int> A(x + 1);
    int mi = 1e9;
    for (int a = 1; a < x; a++){
        auto b = x - a;
        auto pa = prime_factorize(a, lp);
        auto pb = prime_factorize(b, lp);
        int ca = 1, cb = 1;
        for (const auto &[k, v] : pa)
            ca *= (v + 1);
        for (const auto &[k, v] : pb)
            cb *= (v + 1);
        auto s = abs(a - ca - (b - cb));
        A[a] = s;
        mi = min(mi, s); 
    }

    for (int i = 1; i < x; i++){
        if (A[i] == mi){
            cout << i << " " << x - i << endl;
        }
    }
}