/**
	author:  shobonvip
	created: 2026.04.19 06:20:53
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n; cin >> n;
	vector<tuple<int,int,int>> e;
	rep(i,0,min(n,2*n-3)) {
		e.emplace_back(i, (i+1)%n, 1);
	}

	vector<int> v(max(0,n-3));
	if (n >= 6) {
		rep(i,0,n-3) {
			v[i] = i + 2;
			e.emplace_back(0, 1, v[i]);
		}
	} else {
		vector<int> t = {3, 2};
		rep(i,0,n-3) {
			v[i] = t[i];
			e.emplace_back(0, 1, v[i]);
		}
	}

	cout << (int)e.size() << '\n';
	rep(i,0,(int)e.size()) {
		auto [x, y, z] = e[i];
		cout << x+1 << ' ' << y+1 << ' ' << z << '\n';
	}

	vector<bool> is_square(1025);
	rep(i,0,33) is_square[i*i] = 1;

	rep(i,0,n) {
		rep(j,i+1,n) {
			vector<int> ans;
			if (i + 1 == j) {
				ans.emplace_back(i);
			} else if (i == 0 && j == n-1) {
				ans.emplace_back(n-1);
			} else if (i == 0) {
				int geta = j - 1;
				if (is_square[1 + geta]) {
					ans.emplace_back(0);
				} else {
					bool mode = 0;
					rep(x,0,n-3) {
						if (is_square[v[x] + geta]) {
							mode = 1;
							ans.emplace_back(n + x);
							break;
						}
					}
					if (!mode) cout << i << ' ' << j << endl;
					assert(mode);
				}
				rep(x,1,j) ans.emplace_back(x);
			} else {
				// i -> 1, 0 -> j
				int geta = i + n - j - 1;
				rrep(x,1,i) ans.emplace_back(x); 
				if (is_square[1 + geta]) {
					ans.emplace_back(0);
				} else {
					bool mode = 0;
					rep(x,0,n-3) {
						if (is_square[v[x] + geta]) {
							mode = 1;
							ans.emplace_back(n + x);
							break;
						}
					}
					if (!mode) cout << i << ' ' << j << endl;
					assert(mode);
				}
				rrep(x,j,n) ans.emplace_back(x);
			}

			for (int x: ans) {
				cout << x + 1 << ' ';
			}
			cout << '\n';
		}

	}
}