#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define range(x) (x).begin(), (x).end()
const int dir[][2] = {1, 0, -1, 0, 0, 1, 0, -1};

void solve()
{
    int k;
    cin >> k;
    int n = 1024;
    int m = 512 * 511;
    cout << n << ' ' << m << " 2\n";
    for (int i = 1; i <= n; ++i) {
        cout << (i % 2) + 1 << ' ';
    }
    cout << '\n';
    // int cnt = 0;
    for (int i = 1; i <= n; i += 2) {
        for (int j = 2; j <= n; j += 2) {
            if (((j - 1) ^ 1) + 1 == i)
                continue;
            cout << i << ' ' << j << '\n';
            // ++cnt;
        }
    }

    // assert(cnt == m);
    // cout << cnt << '\n';
}

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

    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}