// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return b < a ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;

int k;
vii eg;
vi adj[MAXN];
int c[MAXN], occ[MAXN];

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> k;
    int n = 1024;
    REP (i, 0, n / 2) {
        RREP (j, i - 1, 0) {
            eg.pb({j * 2 + 2, i * 2 + 1});
            eg.pb({j * 2 + 1, i * 2 + 2});
        }
    }
    cout << n << ' ' << SZ(eg) << ' ' << 2 << '\n';
    REP (i, 1, n + 1) {
        cout << i % 2 + 1 << ' ';
    }
    cout << '\n';
    for (auto [u, v] : eg) {
        assert(u % 2 != v % 2);
        adj[u].pb(v);
        adj[v].pb(u);
        cout << u << ' ' << v << '\n';
    }
    int mx = 0;
    REP (u, 1, n + 1) {
        for (int v : adj[u]) {
            occ[c[v]] = 1;
        }
        REP (i, 1, n + 5) {
            if (!occ[i]) {
                c[u] = i;
                mxto(mx, c[u]);
                break;
            }
        }
        for (int v : adj[u]) {
            occ[c[v]] = 0;
        }
    }
    return 0;
}