#include<bits/stdc++.h>
using namespace std;
const int N=20;
int hb(int x)
{
	int ans=0;
	while(x>=(1<<(ans)))ans++;
	return ans;
}
struct node{int x,y,c;};
signed main()
{
	int n,pos=0;cin>>n;n--;
	int x=hb(n+1);vector<node>ans;
	for(int i=1;i<x;i++)
		ans.push_back({i,i+1,(1<<(i-1))}),
		ans.push_back({i,i+1,0});
	pos=(1<<x-1)-1;
	while(pos<n)
	{
		int y=hb(n-pos);
		ans.push_back({y,x,pos+1});
		pos+=(1<<y-1);
	}
	cout<<x<<' '<<ans.size()<<'\n';
	for(auto i:ans)cout<<i.x<<' '<<i.y<<' '<<i.c<<'\n';
	return 0;
}