//#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const ll INF = 1e9;
const ll LINF = ll(1e18) + 1;
const ll MOD = 1000000007;
const ll dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const ll Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll x;
//約数列挙オーダー√n
vector<ll> divisor(ll n){
    vector<ll> res;
    for(ll i=1;i*i<=n;i++)
    if(n%i==0){
        res.push_back(i);
        if(i!=n/i)res.push_back(n/i);
    }
    return res;
}
int  main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> x;
    vector<vector<ll>> ans(100000);
    for(int i=x/2-2*sqrt(x)+1;i<=x/2+2*sqrt(x)+1;i++){
        vector<ll> a=divisor(i);
        vector<ll> b=divisor(x-i);
        ll temp=i-a.size();
        ll temp1=x-i-b.size();
        ll temp2=abs(temp-temp1);
        ans[temp2].push_back(i);
    }
    for(int i=0;i<x;i++){
        if(ans[i].size()!=0){
            rep(j,ans[i].size()){
            cout<<ans[i][j]<<" "<<x-ans[i][j]<<"\n";
            }
            return 0;
        }
    }
}