#include<bits/stdc++.h>
#define fo(i, n) for(int i = 0; i < (n); i++)
#define pb push_back
#define ff first
#define ss second
#define vt vector
#define ins insert
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using namespace std;

typedef unsigned long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef map<int, int> mii;
typedef vt<int> vti;
const double Pi = acos(- 1.0);
template<typename T>ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {for(T x : vec) cout << x << ' '; cout << endl;return os;}
const int inf = INT_MAX;

// 1000000000000000000
// 423539247696576512
void Duck(){
	ll n; cin >> n;
	
	int x = 0, y = 0;
	vt<array<int, 3>> ans1;
	vt<array<int, 2>> ans2;
	auto Add1 = [&](int x, int y, int t = 0){
		ans1.pb({x, y, t});
	};
	auto Add2 = [&](int x, int y){
		ans2.pb({x, y});
	};
	auto Do = [&](int i){
		int wait = 59 - i;
		if(wait != 0){
			Add1(x, y, 1);
			x++;	
			for(int k = 1; k < wait; k++){
				Add1(x, y);
				x++;
			}
		}
		
		for(int r = 0; r <= i; r++){
			for(int c = 0; c <= i; c++){
				Add1(x + r, c, (r == 0 && c == 0 && !wait ? 1 : 0));
				if(r + c == i){
					Add2(x + r, c);
				}
				
			}
		}
		//x++, y++;
		x += i + 3;
	};
	
	for(int i = 0; i < 60; i++){
		if((n >> i) & 1){
			Do(i);
			//cout << debug(i);
		}
	}
	//cout << endl;
//	Do(59);
	cout << ans1.size() << endl;
	for(auto [x, y, t] : ans1){
		cout << x << ' ' << y << ' ' << t << endl;
	}
	cout << ans2.size() << ' ' << 59 << endl;
	for(auto [x, y] : ans2){
		cout << x << ' ' << y << endl;
	}
}



int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	/*Duck3*/
	int t = 1;
	#ifndef ONLINE_JUDGE
		freopen("input.txt", "r", stdin);
	#endif
	//cin >> t;
	while(t--) Duck();
	return 0;
}
/*
Test:

*/