// 私は猫です

#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define inf 1000000000
#define infll 1000000000000000000ll
#define pii pair<int,int>
#define rep(i,a,b,c) for(int i=(a);i<=(b);i+=(c))
#define per(i,a,b,c) for(int i=(a);i>=(b);i-=(c))
#define F(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define dF(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define cmh(sjy) while(sjy--)
#define lowbit(x) (x&(-x))
#define HH printf("\n")
#define eb emplace_back
#define poly vector<int>
using namespace std;
template<typename T>inline void chkmax(T &x,const T &y){ x=std::max(x,y); }
template<typename T>inline void chkmin(T &x,const T &y){ x=std::min(x,y); }
const int mod=998244353,maxn=500005;
vector<array<int,3>>a,ans;
vector<int>g[maxn];
int m,vis[maxn];
void solve(){
	const int n=1893;
	F(i,1,n)if(i*i+i+1<=n)m=i;
	F(i,0,m-1)F(j,0,m-1)a.push_back({1,i,j});
	F(i,0,m-1)a.push_back({0,1,i});
	a.push_back({0,0,1});
	const int siz=a.size();
	F(i,0,siz-1)F(j,i+1,siz-1){ int sum=0; F(k,0,2)sum+=a[i][k]*a[j][k]; if(sum%m==0)g[i].push_back(j),g[j].push_back(i); }
	F(i,0,siz-1){
		for(int j:g[i])vis[j]=1;
		for(int j:g[i])if(j>i)for(int k:g[j])if(k>j&&vis[k])ans.push_back({i+1,j+1,k+1});
		for(int j:g[i])vis[j]=0;
	} printf("%d\n",(int)ans.size()); for(auto it:ans)printf("%d %d %d\n",it[0],it[1],it[2]);
}
signed main(){
	const int zsy=1;
	F(____,1,zsy)solve();
}