#include <bits/stdc++.h>

using namespace std;

using ll = long long;

void solve() {
    int k;
    cin >> k;
    int n = 1024, c = 2;
    vector<pair<int, int>> es;
    vector<int> col(n + 1);
    for(int i = 1; 2 * i <= n; i++) {
        col[2 * i] = 1, col[2 * i - 1] = 2;
        for(int j = 1; j < i; j++) {
            es.push_back({2 * j - 1, 2 * i});
            es.push_back({2 * i - 1, 2 * j});
        }
    }
    cout << n << ' ' << es.size() << ' ' << c << '\n';
    for(int i = 1; i <= n; i++) cout << col[i] << " \n"[i == n];
    for(auto [i, j] : es) cout << i << ' ' << j << '\n';
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}