#include<bits/stdc++.h>
#define pb push_back
#define fi first 
#define se second 
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

const int N=1e3+5;
int k,n;
vector<pii>ve;

void input()
{
    scanf("%d",&k);
    n=k+2;
}

int num(int x,int y) {return x*2-2+y;}

void ade(int x,int y) {ve.pb({y,x});}

void solve()
{
    input();
    for(int i=2;i<=n;i++)
    {
        for(int j=1;j<i;j++) ade(num(i,1),num(j,2)),ade(num(i,2),num(j,1));
    }
    printf("%d %d %d\n",n*2,ve.size(),2);
    for(int i=1;i<=n*2;i++) printf("%d ",i%2+1);
    printf("\n");
    for(auto [x,y]:ve) printf("%d %d\n",x,y);
}

int main()
{
    solve();
}