#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef double db;

const int N = 1 << 11;
int n;
VI g[N];

int badSolve()
{
	int mx = 1;
	VI ans(n);
	FOR(i, 0, n)
	{
		VI vals;
		for(int to : g[i])
		{
			if(to > i)
				continue;
			vals.PB(ans[to]);
		}
		VI has(SZ(vals) + 2);
		for(int val : vals)
			if(val < SZ(has))
				has[val] = 1;
		int cur = 1;
		while(has[cur]) cur++;
		ans[i] = cur;
		mx = max(mx, cur);
		
	}
	return mx;
}


int m = 0;
void addEdge(int v, int u)
{
	g[v].PB(u);
	g[u].PB(v);
	m++;
}


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

	int k;
	cin >> k;
	
	int c = 4;
	FOR(i, 0, c)
		FOR(j, 0, i)
			addEdge(i, j);
	addEdge(c, c + 1);
	
	n = c + 2 + 2 * k;
	VI ans(n);
	FOR(i, 0, c)
		ans[i] = i + 1;
	ans[c] = 3;
	ans[c + 1] = 4;

	FOR(i, 0, k)
	{
		FOR(t, 0, 2)
		{
			int v = c + 2 + 2 * i + t;
			FOR(j, 2, c)
				addEdge(v, j);
			addEdge(v, c);
			addEdge(v, c + 1);
			
			FOR(j, 0, i)
				addEdge(c + 2 + 2 * j + (t ^ 1), v);
			ans[v] = t + 1;
		}
    }
	cout << n << " " << m << " " << c << "\n";
	FOR(i, 0, n)
	{
		if(i)
			cout <<  " ";
		cout << ans[i];
	}
	cout << "\n";
	FOR(i, 0, n)
	{
		for(int to : g[i])
		{
			assert(ans[i] != ans[to]);
			if(to < i)
				cout << to + 1 << " " << i + 1 << "\n";
		}
	}
	
	//cerr << n << "\n";
	//cerr << badSolve() << " " << c + k << "\n";
	
	return 0;
}