#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=3e5+5,M=N*4+5,K=1e7+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int k,n=1024,col[N];
int f[N];
vector<int> S[N];
void Solve(){
	scanf("%d",&k);
	vector<int> s1,s2;
	vector<pii> e;
	s1.push_back(1);s1.push_back(4);
	s2.push_back(2);s2.push_back(3);
	e.emplace_back(1,2);e.emplace_back(3,4);
	for(int i=5;i<=n;i+=2){
		for(int j:s2) e.emplace_back(i,j);
		for(int j:s1) e.emplace_back(i+1,j);
		s1.push_back(i);s2.push_back(i+1);
	}
	printf("%d %d %d\n",n,int(e.size()),2);
	for(int i:s1) col[i]=1;for(int i:s2) col[i]=2;
	for(int i=1;i<=n;i++){
		printf("%d%c",col[i]," \n"[i==n]);
	}
	for(auto i:e) printf("%d %d\n",i.fi,i.se);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}