#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()

typedef long long ll;
typedef pair<ll, ll> P;

const int mod =  1000000007;  //出力は (ans % mod + mod) % mod  (負の剰余を正にする)
const int inf = 1e9;
const long long INF = 1LL << 60;   // INF = 11

map<ll,ll> prime_factors(ll n){
    map<ll,ll> res;
    if(n == 1){
        res[n] = 1;
        return res;
    }
    for(ll i = 2; i * i <= n; i++){
        while(n % i == 0){
            ++res[i];
            n /= i;
        }
    }
    if(n != 1){
        res[n] = 1;
    }
    return res;
}

ll num_of_divisor(ll n){
    map<ll,ll> m = prime_factors(n);
    ll res = 1;
    for(auto i : m){
        res *= (i.second+1);
    }
    return res;
}

int main()
{
    ll x; cin >> x;
    ll num = INF;
    for(int i = 1; i < x; i++){
        ll a = i,b = x - i;
        num = min(abs(a - num_of_divisor(a) - b + num_of_divisor(b)),num);
    }
    for(int i = 1; i < x; i++){
        ll a = i,b = x - i;
        if(num == abs(a - num_of_divisor(a) - b + num_of_divisor(b))){
            cout << a << ' ' << b << endl;
        }
    }
}