//#include <atcoder/all>
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<pair<ll, ll>>>;



int main(){
   ll X;
   cin>>X;

   vll A(X+1,1);
    for(ll i=2;i<=X;i++){
        for(ll j=i;j<=X;j+=i){
            A[j]++;
        }
    }
    ll an=1e18;
    rep(i,X-1){
        ll AA=i+1;
        ll B=X-AA;
        an=min(an,abs((AA-A[AA])-(B-A[B])));
    }
    rep(i,X-1){
        ll AA=i+1;
        ll B=X-AA;
        if(abs((AA-A[AA])-(B-A[B]))==an){
            cout<<AA<<" "<<B<<endl;
        }
    }
    //cout<<an<<endl;
}