#include <bits/stdc++.h>

using namespace std;

bool s(int n) {
    if (n < 0) return false;
    int r = round(sqrt(n));
    return r * r == n;
}

int main() {
    int n;
    cin >> n;
    if (n < 2) return 0;
    vector<int> a(n + 1), b(n + 1);
    int w;
    for (w = 1; w <= 200; ++w) {
        vector<bool> u(201, 0);
        u[w] = 1;
        bool ok = true;
        for (int i = 3; i <= n; ++i) {
            bool fi = false;
            for (int va = 1; va <= 200; ++va) {
                if (u[va]) continue;
                for (int vb = 1; vb <= 200; ++vb) {
                    if (va == vb || u[vb]) continue;
                    if (!(s(va) || s(w + vb))) continue;
                    if (!(s(vb) || s(w + va))) continue;
                    bool okj = true;
                    for (int j = 3; j < i; ++j) {
                        if (!s(va + a[j]) && !s(vb + b[j]) && !s(va + w + b[j]) && !s(vb + w + a[j])) {
                            okj = false;
                            break;
                        }
                    }
                    if (okj) {
                        a[i] = va;
                        b[i] = vb;
                        u[va] = u[vb] = 1;
                        fi = true;
                        break;
                    }
                }
                if (fi) break;
            }
            if (!fi) {
                ok = false;
                break;
            }
        }
        if (ok) break;
    }
    int m = (n == 2) ? 1 : 2 * n - 3;
    cout << m << endl;
    cout << "1 2 " << w << endl;
    for (int i = 3; i <= n; ++i) cout << "1 " << i << " " << a[i] << endl;
    for (int i = 3; i <= n; ++i) cout << "2 " << i << " " << b[i] << endl;
    for (int i = 1; i < n; ++i) {
        for (int j = i + 1; j <= n; ++j) {
            vector<int> q;
            if (i == 1 && j == 2) {
                q = {1};
            } else if (i == 1) {
                if (s(a[j])) q = {j - 1};
                else q = {1, n + j - 3};
            } else if (i == 2) {
                if (s(b[j])) q = {n + j - 3};
                else q = {1, j - 1};
            } else {
                if (s(a[i] + a[j])) q = {i - 1, j - 1};
                else if (s(b[i] + b[j])) q = {n + i - 3, n + j - 3};
                else if (s(a[i] + w + b[j])) q = {i - 1, 1, n + j - 3};
                else q = {n + i - 3, 1, j - 1};
            }
            cout << q.size();
            for (int v : q) cout << " " << v;
            cout << endl;
        }
    }
    return 0;
}