#include<bits/stdc++.h>
using std::cin;
using std::cout;
const int N = 100005;
using vec = std::vector<int>;
using vpi = std::vector<std::pair<int, int>>;
std::map<vec, int> map;
std::map<vec, vpi> deletes;
std::map<vec, vec> nxt;

int n;
int dfs(vec x) {
	if(x.empty()) return 0;
	if(map.count(x)) return map[x];

	int ans = 1e9;
	vpi del; vec nx;
	for(int i = 1;i < (1 << x.size());++i) {
		if(i & i >> 1) continue;
		int sum = 0;
		vec z;
		for(int j = 0;j < (int) x.size();++j) if(i >> j & 1) {
			sum += (j == (int) x.size() - 1 ? n : x[j + 1]) - x[j];
		} else {
			z.push_back(x[j]);
		}
		int co = (sum + 3) / 4 + dfs(z);
		if(co < ans) {
			ans = co;
			del.clear();
			for(int j = 0;j < (int) x.size();++j) if(i >> j & 1) {
				int nxt = j == (int) x.size() - 1 ? n : x[j + 1];
				for(int k = x[j];k < nxt;++k) del.emplace_back(x[j], k + 1);
			}
			nx = z;
		}
	}
	deletes[x] = del;
	nxt[x] = nx;
	return map[x] = ans;
}
std::string s[N];

int main() {
	cin >> n;
	vec v;
	for(int i = 1;i < n;++i) {
		v.push_back(i);
	}
	for(int i = 1;i <= n;++i) {
		if(i < 10) s[i] = '0' + i;
		else s[i] = 'a' + i - 10;
	}
	dfs(v);
	cout << dfs(v) << '\n';
	for(;v.size();) {
		auto d = deletes[v];
		for(;d.size() % 4;) d.emplace_back(2e3, 2e3);

		for(auto [u, v] : d) {
			cout << v << ' ' << u << ' ' << v << '\n';
			s[v] = s[u] + s[v];
		}
		v = nxt[v];
	}
//	for(int i = 1;i <= n;++i) cout << s[i] << '\n';
}