#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using ll = long long;

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    int k;
    cin >> k;
    int n = 2 * (k + 2);
    vector<pair<int, int>> es;
    vector<int> cs(n);
    for (int i = 0; i < n; i++) cs[i] = (i & 1) + 1;
    for (int i = 0; i < n; i += 2) {
        for (int j = 1; j < n; j += 2) {
            if (j != i + 1) {
                es.emplace_back(i, j);
            }
        }
    }
    int m = es.size(), c = 2;

    cout << n << " " << m << " " << c << "\n";
    cout << cs << "\n";
    for (auto [u, v] : es) cout << u + 1 << " " << v + 1 << "\n";
    return 0;
}