#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
typedef long long int ll;

#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define endl "\n"
const double EPS = 1e-7;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const double PI = acos(-1);
const int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

//-------------------------------------

using P = pair<int, int>;

vector<ll> divisor(ll n) {
    vector<ll> ret;
    for(ll i = 1; i * i <= n; i++) {
        if(n % i == 0) {
            ret.push_back(i);
            if(i * i != n)
                ret.push_back(n / i);
        }
    }
    sort(begin(ret), end(ret));
    return (ret);
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int x;
    cin >> x;
    int mid = (x + 1) / 2;
    vector<pair<int, P>> v;
    for(int i = max(mid - 1000, 1); i <= mid; i++) {
        auto y = divisor(i);
        auto y2 = divisor(x - i);
        int d = abs((i - (int)y.size()) - (x - i - (int)y2.size()));
        v.push_back(make_pair(d, P(i, x - i)));
    }
    sort(ALL(v));
    int mn = v.front().first;
    vector<P> ans;
    for(int i = 0; i < v.size(); i++) {
        if(v[i].first > mn) {
            break;
        }
        ans.push_back(v[i].second);
        P tmp = v[i].second;
        swap(tmp.first, tmp.second);
        ans.push_back(tmp);
    }
    sort(ALL(ans));
    ans.erase(unique(ALL(ans)), ans.end());
    for(auto i : ans) {
        cout << i.first << ' ' << i.second << endl;
    }
}