#include <bits/stdc++.h>
#define FOR(i, n, m) for (long long i = (n); i < (long long)(m); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 998244353;
constexpr ld eps = 1e-6;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
    os << to_string(p.first) << " " << to_string(p.second);
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
    REP(i, v.size()) {
        if (i) os << " ";
        os << v[i];
    }
    return os;
}

constexpr int K = 40;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll a;
    cin >> a;

    int N = 3 * K + 1;
    vector<pair<int, int>> edges;

    for (int i = 0; i < K; i++) {
        if (i != K - 1) {
            edges.pb({3 * i, 3 * (i + 1)});
            edges.pb({3 * i + 1, 3 * (i + 1) + 1});
            edges.pb({3 * i + 1, 3 * (i + 1) + 2});
            edges.pb({3 * i + 2, 3 * (i + 1) + 2});
            edges.pb({3 * i + 2, 3 * (i + 1) + 1});
        } else {
            edges.pb({3 * i + 1, N - 1});
            edges.pb({3 * i + 2, N - 1});
        }

        if (a & (1LL << (K - 1 - i))) {
            edges.pb({3 * i, 3 * i + 1});
        }
    }

    for (auto &edge : edges) {
        edge.first++;
        edge.second++;
    }

    int M = (int)edges.size();

    cout << N << " " << M << endl;
    for (auto edge : edges) cout << edge << endl;

    return 0;
}