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

typedef long long int i64;

int n, k;
int ans[1001001][3];

int main() {
	scanf("%d", &n);
	k = (n-1)/3;
	for(int a=2, b=k+2;a<=k+1;a++, b+=2) {
		ans[a-1][0] = a;
		ans[a-1][1] = b;
		ans[a-1][2] = b+1;
	}

	for(int i=k;i>0;i--) {
		int a = ans[i][0], b = ans[i][1], c = ans[i][2];
		int det = 1;
		while(b>0 && (i64)a*a+(i64)b*b>=(i64)c*c) { b--; det++; }
		ans[i][1] = b;
		for(int j=i-1;j>i-det;j--) {
			ans[j][1] = ans[j+1][1]-1;
			ans[j][2] = ans[j+1][2]-1;
		}
	}
	printf("%d\n", k);
	for(int i=1;i<=k;i++)
		printf("%d %d %d\n", ans[i][0], ans[i][1], ans[i][2]);
	
	return 0;
}