#include <bits/stdc++.h>
using namespace std;

using pii = pair<int, int>;
const int N = 2048;

int n, c[N];
vector<int> v[2];
vector<pii> ans;

int main() {
    int k;
    cin >> k;
    k += 2;
    v[0].push_back(1);
    v[1].push_back(2);
    ans.emplace_back(1, 2);
    c[1] = 1;
    c[2] = 2;

    for(int i = 3, lst = 1; i <= k; i ++) {
        for(int j : v[lst ^ 1])
            if(c[j] < i - 2) ans.emplace_back(j, i * 2 - 3);
        c[i * 2 - 3] = i - 2;
        v[lst].push_back(i * 2 - 3);
        for(int j : v[lst])
            ans.emplace_back(j, i * 2 - 2);
        c[i * 2 - 2] = i;
        v[lst ^= 1].push_back(i * 2 - 2);
    }

    cout << k * 2 - 2 << " " << ans.size() << " 2\n";
    for(int i = 1; i <= k * 2 - 2; i ++)
        if(binary_search(v[0].begin(), v[0].end(), i)) cout << "1 ";
        else cout << "2 ";
    cout << "\n";
    for(auto [a, b] : ans) cout << a << " " << b << "\n";
}