#include<bits/stdc++.h>
using namespace std;
#define FOR(i,s,t) for(int i=(s),_t=(t); i<=_t; ++i)
#define DOR(i,s,t) for(int i=(s),_t=(t); i>=_t; --i)
typedef long long ll;
const int Mod=7000009;
bool mark[Mod];
int Hash(const vector<int> &v) {
    int w=0;
    for(auto x: v) w=(w*233+x)%Mod;
    return w;
}
struct node {
    int a,b;
};
struct state {
    vector<int> lp;
    vector<vector<node>> ans;
};
void print(vector<vector<node>> ans) {
    cout << ans.size() << '\n';
    for(auto s: ans) {
        FOR(i,0,3) {
            int j=min(i,(int)s.size()-1);
            cout << s[j].b << ' ' << s[j].a << ' ' << s[j].b << '\n';
        }
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    state q;
    q.lp={0};
    FOR(i,1,n) q.lp.push_back(i);
    vector<vector<int>> f;
    FOR(i,2,n) FOR(j,i+1,n) FOR(k,j+1,n) FOR(h,k+1,n) f.push_back({i,j,k,h});
    FOR(i,2,n) FOR(j,i+1,n) FOR(k,j+1,n) f.push_back({i,j,k});
    FOR(i,2,n) FOR(j,i+1,n) f.push_back({i,j});
    FOR(i,2,n) f.push_back({i});
    queue<state> Q;
    mark[Hash(q.lp)]=1;
    Q.push(q);
    while(!Q.empty()) {
        q=Q.front(),Q.pop();
        for(auto v: f) {
            state nq=q;
            vector<node> op;
            int w=1;
            for(auto x: v) {
                if(q.lp[x]>1) {
                    nq.lp[x]=q.lp[q.lp[x]-1];
                    op.push_back({q.lp[x]-1,x});
                } else {
                    w=0;
                    break;
                }
            }
            if(!w) continue;
            w=1;
            FOR(i,1,n) if(nq.lp[i]!=1) {w=0;break;}
            nq.ans.push_back(op);
            if(w) {
                print(nq.ans);
                return 0;
            }
            if(mark[Hash(nq.lp)]) continue;
            mark[Hash(nq.lp)]=1;
            Q.push(nq);
        }
    }
    return 0;
}