#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define m_p make_pair
#define sz(x) (int)(x.size())
const int N = 300005;
const int D = 42, K = D + D + 1, P = 100;
ll n;
ll a[55][555];
pair<ll, pair<int, int> > b[10005];

int main() {
	a[0][D + 1] = 1;
	for (int i = 1; i <= D; ++i) {
		for (int j = 1; j <= K; ++j) {
			a[i][j] = a[i - 1][j - 1] + a[i - 1][j] + a[i - 1][j + 1];
		}
	}
	int m = 0;
	for (int nu = 1; nu <= P; ++nu) {
		for (int i = 1; i <= K; ++i) {
			b[++m] = m_p(a[D][i], m_p(nu + nu - 1, i));
		}
	}
	sort(b + 1, b + m + 1);
	reverse(b + 1, b + m + 1);
	int cur = 1;
	scanf("%lld", &n);
	ll nn = n;
	vector<pair<int, int> > ans;
	/*for (int i = 1; i <= m; ++i) {
		printf("%d %lld %d %d\n", i, b[i].first, b[i].second.first, b[i].second.second);
	}
	return 0;*/
	while (n) {
		while (cur < m && n < b[cur].first) cur++;
		n -= b[cur].first;
		pair<int, int> tmp = b[cur].second;
		ans.push_back(tmp);
		cur += 1;
	}
	printf("%d\n", P * K);
	for (int l = 1; l <= P; ++l) {
		for (int i = 1; i <= K; ++i) {
			printf("%d %d %d\n", l + l - 1, i, i == D + 1);
		}
	}
	printf("%d %d\n", sz(ans), D);
	ll tot = 0;
	for (auto [x, y] : ans) {
		printf("%d %d\n", x, y);
		tot += a[D][y];
	}
	// printf("%lld %lld\n", tot, nn);
	// assert(tot == nn);
	return 0;
}