#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto&(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())

int main() {
  int x;
  cin >> x;
  vector<int> d(x,0);
  FOR(i,1,x){
    for(int j=1; j*j <=i; j++){
      if(i%j!=0){
        continue;
      }
      if(j*j==i){
        d[i]++;
        break;
      }
      d[i] += 2;
    }
  }
  vector<int> score(x+1);
  int mini = 1e9;
  FOR(i,1,x){
    score[i] = abs(i-d[i]-(x-i-d[x-i]));
    mini = min(mini,score[i]);
  }
  FOR(i,1,x){
    if(score[i] == mini){
      printf("%lld %lld\n", i, x-i);
    }
  }
}