#include <bits/stdc++.h>
#define For(i,l,r) for(int i=l; i<=r; i++)
#define per(i,r,l) for(int i=r; i>=l; i--)
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
using namespace std;
int a1[][3]={
{2,1,2},{4,3,4},{6,5,6},{8,7,8},
{3,2,3},{4,2,4},{7,6,7},{8,6,8},
{5,4,5},{6,4,6},{7,4,7},{8,4,8}
};
int a2[][3]={
{2,1,2},{4,3,4},{6,5,6},{9,8,9},
{3,2,3},{4,2,4},{7,6,7},{10,9,10},
{5,4,5},{6,4,6},{7,4,7},{11,10,11},
{8,7,8},{9,7,9},{10,7,10},{11,7,11}
};
int a3[][3]={
{2,1,2},{4,3,4},{6,5,6},{9,8,9},
{3,2,3},{4,2,4},{7,6,7},{10,9,10},
{5,4,5},{6,4,6},{7,4,7},{12,11,12},
{8,7,8},{9,7,9},{10,7,10},{13,12,13},
{11,10,11},{12,10,12},{13,10,13},{2000,2000,2000}
};
int a4[][3]={
{2,1,2},{4,3,4},{6,5,6},{8,7,8},
{3,2,3},{4,2,4},{9,8,9},{11,10,11},
{5,4,5},{6,4,6},{12,11,12},{14,13,14},
{7,6,7},{8,6,8},{9,6,9},{15,14,15},
{10,9,10},{11,9,11},{12,9,12},{16,15,16},
{13,12,13},{14,12,14},{15,12,15},{16,12,16}
};
int b[1005];
struct node{
    int x,y,z;
};
vector<node> v[1005];
queue<node> q[1005];
int main(){
    int n,ans,x,y,z; cin>>n; ans=n;
    For(i,1,500)
        For(j,1,333)
            For(k,0,250) if (i*2+j*3+k*4==n-2){
                int s=n-2-i-j-k;
                int c=n-1;
                if (!k) ++c;
                if ((i+j+k+1)*4>=s+c){
                    //cout<<i<<' '<<j<<' '<<k<<endl;
                    if ((i+j+k+1)<ans){
                        ans=i+j+k+1,x=i,y=j,z=k;
                    }
                }
            }
    printf("%d\n",ans);
    int cnt=1,l=3; b[2]=1; v[1].push_back(node{2,1,2});
    For(i,1,x){
        ++cnt;
        For(j,l,l+1) b[i]=cnt,v[cnt].push_back(node{j,l-1,j});
        q[cnt].push(node{l+1,l,l+1});
        l+=2;
    }
    For(i,1,y){
        ++cnt;
        For(j,l,l+2) b[i]=cnt,v[cnt].push_back(node{j,l-1,j});
        q[cnt].push(node{l+1,l,l+1}); q[cnt].push(node{l+2,l+1,l+2});
        l+=3;
    }
    For(i,1,z){
        ++cnt;
        For(j,l,l+3) b[i]=cnt,v[cnt].push_back(node{j,l-1,j});
        q[cnt].push(node{l+1,l,l+1}); q[cnt].push(node{l+2,l+1,l+2}); q[cnt].push(node{l+3,l+2,l+3});
        l+=4;
    }
    For(i,1,ans){
        for(auto o:v[i]) cout<<o.x<<' '<<o.y<<' '<<o.z<<endl;
        int cc=4-v[i].size(),xx=1;
        while(cc&&xx<=n){
            if (!q[xx].empty()){
                auto o=q[xx].front(); q[xx].pop();
                --cc;
                cout<<o.x<<' '<<o.y<<' '<<o.z<<endl;
            }
            ++xx;
        }
        if (cc){
            For(j,1,cc) cout<<2000<<' '<<2000<<' '<<2000<<endl;
        } 
    }
    //cout<<x<<' '<<y<<' '<<z<<endl;
}