#include<bits/stdc++.h>
#define For(i,x,y) for (int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (int i=(x);i<(y);i++)
#define Dow(i,x,y) for (int i=(x);i>=(y);i--)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pa;
inline ll read(){
    ll x=0;
    scanf("%lld",&x);
    return x;
}

const int N = 1e6+10;
int nxt[N];
inline int Find(int x){
    return nxt[x]==x?x:nxt[x]=Find(nxt[x]);
}
inline void era(int x){
    nxt[x]=x-1;
}

inline ll mysqrt(ll x){
    ll ret=sqrt(x);
    while (ret*ret>x) --ret;
    while ((ret+1)*(ret+1)<=x) ++ret;
    return ret;
}

int main(){
    int n=read();
    if (n<=3) return puts("0"),0;
    int m=(n-1)/3+1;
    printf("%d\n",m-1);
    int c=n;
    For(i,1,n) nxt[i]=i;
    Dow(a,m,2){
        int b=mysqrt(1ll*c*c-1ll*a*a);
        b=Find(b);
        printf("%d %d %d\n",a,b,c);
        //assert(1ll*a*a+1ll*b*b<1ll*c*c);
        era(b);
        c=Find(c-1);
    }
}