#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) { return (ull)rng() % B; }

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<pair<int, int>> v;
    v.emplace_back(3, 2);
    v.emplace_back(4, 1);
    int cur = 3;
    for (int i = 0; i < n; ++i) {
        cur += 2;
        for (int j = cur - 1; j >= 1; j -= 2) {
            v.emplace_back(j, cur);
        }
        for (int j = cur - 2; j >= 1; j -= 2) {
            v.emplace_back(j, cur + 1);
        }
    }
    cout << 4 + 2 * n << " " << v.size() << " " << 2 << '\n';
    for (int i = 0; i < 4 + 2 * n; ++i) {
        cout << i % 2 + 1 << " ";
    }
    cout << '\n';
    for (auto &i : v) {
        cout << i.first << " " << i.second << '\n';
    }
}