#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#define FOR() ll le=e[u].size();for(ll i=0;i<le;i++)
#define QWQ cout<<"QwQ\n";
#define ll long long
#include <vector>
#include <queue>
#include <map>

using namespace std;
const ll N=501010;
const ll qwq=303030;
const ll inf=0x3f3f3f3f;

inline ll read() {
    ll sum = 0, ff = 1; char c = getchar();
    while(c<'0' || c>'9') { if(c=='-') ff = -1; c = getchar(); }
    while(c>='0'&&c<='9') { sum = sum * 10 + c - '0'; c = getchar(); }
    return sum * ff;
}

int K;
int n,m,c;

int main() {
    K = read();
    n = 4+2*K; m = n/2*(n/2-1); c = 2;
    cout<<n<<" "<<m<<" "<<c<<"\n";
    for(int i=1;i<=n;i++) cout<<(i-1)/2<<" \n"[i==n];
    for(int i=1;i<=n;i+=2) {
        for(int j=2;j<=n;j+=2) {
            if(j==i+1) continue;
            cout<<i<<" "<<j<<"\n";
        }
    }
    return 0;
}

/*

4
arcos 2
gausr 5
scrail 3
bei 3

*/