#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> score(x,0);
  FOR(i,1,x){
    score[i] = i;
  }
  for(int i=1; i<=x-1; i++){
    for(int j=i; j<=x-1; j += i){
      score[j]--;
    }
  }
  vector<int> ans;
  int mini = 1e9;
  FOR(i,1,x/2+1){
    ll t = abs(score[i]-score[x-i]);
    if(t<mini){
      mini = t;
      ans.clear();
      ans.push_back(i);
    }else if(t==mini){
      ans.push_back(i);
    }
  }
  REP(i,SZ(ans)){
    cout << ans[i] << " " << x-ans[i] << endl;
  }
  IREP(i,SZ(ans)){
    if(ans[i] == x-ans[i]){
      continue;
    }
    cout << x-ans[i] << " " << ans[i] << endl;
  }
}