/*
    Author:zeke
    
    pass System Test!
    GET AC!!
*/
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <stack>
#include <bitset>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s) \
    ll(s);      \
    cin >> (s);
#define Scin(s) \
    ll(s);      \
    cin >> (s);
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;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll mod = 1e9 + 7;
ll MOD = 1e9 + 7;
ll INF = 1e18;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll x;
    cin >> x;
    ll res=1e18;
    VP res2;
    for (int i = max(1LL, x / 2 - 50); i <= min(x-1, x / 2 + 50); i++)
    {
        ll a = i;
        ll tempa = i;
        ll b = x - i;
        ll tempb = b;
        map<ll, ll> A;
        map<ll, ll> B;
        rep3(j,2, sqrt(a) + 1)
        {
            if (tempa % j == 0)
            {
                while (tempa % j == 0)
                {
                    
                    A[j]++;
                    tempa /= j;
                }
            }
        }
        A[tempa]++;
        ll sumA=1;
        rep3(j,2,a+1){
            sumA *= (A[j] + 1);
        }

        rep3(j,2, sqrt(b) + 1)
        {
            if (tempb % j == 0)
            {
                while (tempb % j == 0)
                {
                    B[j]++;
                    tempb /= j;
                }
            }
        }
       // cout<<tempb<<endl;
        B[tempb]++;
        ll sumB = 1;
        rep3(j, 2, b + 1)
        {
       //    cout<<B[j]<<" ";
            sumB *= (B[j] + 1);
        }
        //cout<<endl;
     //   cout<<a<<" "<<sumA<<" "<<b<<" "<<sumB<<endl;
        if(res==abs(a-sumA-(b-sumB))){
            res2.push_back({a,b});
        }else if(res>abs(a-sumA-(b-sumB))){
            VP temp;
            res2=temp;
            res2.push_back({a,b});
            res=abs(a-sumA-(b-sumB));
        }
    }
    for(auto i:res2){
        cout<<i.F<<" "<<i.S<<endl;
    }
}