#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#include<regex>
#include<bitset>
#include<complex>
#include<chrono>
#include<random>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(),x.end()
using ll=long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

ll gcd(ll n, ll m) {
	ll tmp;
	while (m!=0) {
		tmp = n % m;
		n = m;
		m = tmp;
	}
	return n;
}

ll lcm(ll n, ll m) {
	return abs(n * m) / gcd(n, m);//gl=xy
}
 
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
 
using namespace std;

#define int64_t ll
map< int64_t, ll > prime_factor(int64_t n) {
  map< int64_t, ll > ret;
  for(int64_t i = 2; i * i <= n; i++) {
    while(n % i == 0) {
      ret[i]++;
      n /= i;
    }
  }
  if(n != 1) ret[n] = 1;
  return ret;
}


using P=pair<ll,ll>;
void solve(){
  ll x;
  cin>>x;
  set<P>st;
  map<ll,ll>mp;
  ll ans=INF;
  rep(i,10000){
    ll a=x/2-i;
    ll b=x-a;
    if(a<=0||b<=0)continue;
    ll sum_a=1,sum_b=1;
    mp=prime_factor(a);
    for(auto e:mp){
      sum_a*=e.second+1;
    }
    ll aa=a-sum_a;
    mp=prime_factor(b);
    for(auto e:mp){
      sum_b*=e.second+1;
    }
    ll bb=b-sum_b;
    if(chmin(ans,abs(aa-bb))){
      st.clear();
      st.emplace(a,b);
      st.emplace(b,a);
    }
    else if(ans==abs(aa-bb)){
      st.emplace(a,b);
      st.emplace(b,a);
    }
  }
  for(auto e:st){
    cout<<e.first<<" "<<e.second<<endl;
  }
}

int main(){
	ios::sync_with_stdio(false);
  cin.tie(0);
	cout<<fixed<<setprecision(15);
  solve();
	return 0;
}