#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define N 410
#define mod 167772161
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define drep(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
#define LL long long
LL rd() {
	LL res=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') f*=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') res=(res<<1)+(res<<3)+(ch^48),ch=getchar();
	return res*f;
}
const int M=105;
LL n;
struct info {
	LL x,y;
	bool operator <(const info &_)const {
		return x<_.x;	
	}
}stk[M*M],a[M],b[M];
int top;
int main() {
//	freopen("a.out","w",stdout);
	n=rd();
	printf("100000\n");
	int X=0,Y=0;
	for(int i=1; i<=1000; ++i) {
		Y=0;
		for(int j=1; j<=100; ++j) {
			if(j==1)printf("%d %d 1\n",X,Y);
			else printf("%d %d 0\n",X,Y);
			Y++;
		}
		X+=2;
	}
	for(int i=1; i<=100; ++i)a[i].y=i;
	a[1].x=1;
	int D=43;
	for(int i=1; i<=43; ++i) {
		for(int i=1; i<=100; ++i)
			b[i].x=a[i-1].x+a[i].x+a[i+1].x,b[i].y=i;
		for(int i=1; i<=100; ++i)a[i]=b[i];
		sort(b+1,b+101);
		if(b[100].x>n) {D=i;break;};
	}
	int H=0;
	for(int i=100; i; --i)
		if(n>=b[i].x&&b[i].x>0) {
			for(int j=1; j<=n/b[i].x; ++j) {
				stk[++top]=(info)<%j*2-2,b[i].y-1%>;
			}
			H+=n/b[i].x,n%=b[i].x;
		}
	printf("%d %d\n",H,D);
	for(int i=1; i<=H; ++i)printf("%lld %lld\n",stk[i].x,stk[i].y);
	return 0;
}