#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
vector<ll> ans;
ll n,a[1010],b[1010];
ll f7[22]={0,2,4,6,6,3,4,7,7,5,6,7,7};
ll f8[22]={0,2,4,6,8,3,4,7,8,5,6,7,8};
ll f9[22]={0,2,4,6,8,3,4,8,8,5,6,8,8,7,9,9,9};
ll f10[22]={0,2,4,6,8,3,4,8,10,5,6,8,8,7,9,10,10};
ll f11[22]={0,2,4,6,8,3,4,8,10,5,6,8,11,7,9,10,11};
void solve(ll x){
	if(x==7){
		fr(i,1,12) ans.push_back(f7[i]);
		return;
	}
	if(x==8){
		fr(i,1,12) ans.push_back(f8[i]);
		return;
	}
	if(x==9){
		fr(i,1,16) ans.push_back(f8[i]);
		return;
	}
	if(x==10){
		fr(i,1,16) ans.push_back(f8[i]);
		return;
	}
	if(x==11){
		fr(i,1,16) ans.push_back(f8[i]);
		return;
	}
	solve(x-5);
	ll tmp[5]={0,0,0,0,0};
	pfr(i,4,1){
		tmp[i]=ans.back();
		ans.pop_back();
	}
	ans.push_back(tmp[1]);
	ans.push_back(tmp[4]);
	ans.push_back(x-3);
	ans.push_back(x-1);
	ans.push_back(tmp[2]);
	ans.push_back(tmp[3]);
	ans.push_back(x-3);
	ans.push_back(x);
	ans.push_back(x-4);
	ans.push_back(x-2);
	ans.push_back(x-1);
	ans.push_back(x);
}
int main(){
	n=read();
	solve(n);
	fr(i,1,n) a[i]=i;
	writeln(ans.size()/4);
	fr(i,0,(ll)ans.size()/4-1){
		fr(j,1,n) b[j]=a[j];
		fr(j,0,3){
			pf("%lld %lld %lld\n",b[ans[i*4+j]]-1,ans[i*4+j],ans[i*4+j]);
			a[ans[i*4+j]]=b[b[ans[i*4+j]]-1];
		}
	}
}