#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <random>
#include <vector>
#include <array>
#include <bitset>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>

using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); }
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(20);
    int k;
    cin >> k;
    using P = pair<int, int>;
    V<P> v;
    for (int i = 1; i < 31; i++) {
        for (int j = 0; j < i; j++) v.push_back(P(j, i));
    }
    for (int j = 31; j >= 0; j--) {
        int x = (1<<max(0, (j-1)));
        if (x <= k) {
            k -= x;
            v.push_back(P(j, 31));
        }
    }
    cout << 32 << " " << v.size() << endl;
    for (auto p: v) {
        cout << p.first+1 << " " << p.second+1 << endl;
    }
    return 0;
}