#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 countDivisors(int i){
  int cnt = 0;
  for(int j=1; j*j <=i; j++){
    if(i%j!=0){
      continue;
    }
    if(j*j==i){
      cnt++;
      break;
    }
    cnt += 2;
  }
  return cnt;
}

int main() {
  int x;
  cin >> x;
  vector<int> ans;
  int mini = 1e9;
  for(int i=1; 2*i <=x; i++){
    int d1 = countDivisors(i);
    int d2 = countDivisors(x-i);
    int score = abs(i-d1-(x-i-d2));
    if(score < mini){
      mini = score;
      ans.clear();
      ans.push_back(i);
    }else if(score == mini){
      ans.push_back(i);
    }
  }

  REP(i,SZ(ans)){
      printf("%d %d\n", ans[i], x-ans[i]);
  }
  IREP(i,SZ(ans)){
      if(ans[i] == x-ans[i]){
        continue;
      }
      printf("%d %d\n", x-ans[i], ans[i]);
  }
}