#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
            ∧_∧  
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     
    /   \     | |     
    /   / ̄ ̄ ̄ ̄/  |  
  __(__ニつ/     _/ .| .|____  
     \/____/ (u ⊃  
---------------------------------------------------------------------------------------------------*/





int K;
int d[31];
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> K;

    if (K == 0) {
        printf("1 0\n");
        return;
    }

    d[0] = 1;
    rep(i, 1, 31) d[i] = d[i - 1] * 2;

    int n = -1;
    rep(i, 0, 31) if (d[i] <= K) n = i;
    n++;

    vector<pair<int, int>> ans;
    rep(i, 0, n) rep(j, 0, n) if(i < j) ans.push_back({ i + 1, j + 1 });
    rep(i, 0, n) ans.push_back({ i + 1, 32 });

    K -= d[n - 1];

    if (K) {
        rrep(dgt, n, 2) {
            if (K <= d[dgt - 2]) {
                ans.push_back({ dgt, n + 1 });
                K -= d[dgt - 2];
            }
        }

        ans.push_back({ n + 1, 32 });
    }

    int m = ans.size();
    printf("32 %d\n", m);
    rep(i, 0, m) printf("%d %d\n", ans[i].first, ans[i].second);
}