#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fore(i, l, r) for (ll i = (int)l; i <= (int)r; i++)
#define ford(i, r, l) for (ll i = (int)r; i >= (int)l; i--)
const int MAXN = 2123456LL;
ll T, n, m, k;
ll qi[MAXN], tot, ou[MAXN];
ll val[MAXN];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> k;
    ll cnt = 2;
    qi[++tot] = 1;
    ou[++tot] = 2;
    cout << 1020 << " " << 260608 << endl;
    fore(i, 1, 1020)
    {
        if (i % 2 == 1)
            cout << "1 ";
        else
            cout << "0 ";
    }
    cout << endl;
    while (tot <= 510)
    {
        cnt++;
        fore(i, 1, tot)
        {
            cout << ou[i] << " " << cnt << endl;
            m++;
        }
        cnt++;
        fore(i, 1, tot)
        {
            cout << qi[i] << " " << cnt << endl;
            m++;
        }

        qi[++tot] = cnt - 1;
        ou[tot] = cnt;
    }
    cout << cnt << "   " << m << endl;
    return 0;
}