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

const int N = 1e6 + 5;

int used[N];
int n;

int main() {
	scanf("%d", &n);
	while (n % 3 != 1) --n;
	for (int i = 2; i <= n / 3 + 1; i++) used[i] = 1;
	int mx = n;
	printf("%d\n", n / 3);
	for (int i = n / 3 + 1; i >= 2; i--) {
		while (used[mx]) --mx;
		int j = sqrt(1ll * mx * mx - 1ll * i * i) + 3;
		j = min(j, mx - 1);
		while (1ll * mx * mx - 1ll * j * j <= 1ll * i * i || used[j]) --j;
		assert(i + j > mx && 1ll * i * i + 1ll * j * j < 1ll * mx * mx);
		printf("%d %d %d\n", i, j, mx);
		used[j] = used[mx] = 1;
	}
	return 0;
}