#include <bits/stdc++.h>

using namespace std;

using pii = pair<int, int>;
using ll = long long;
const int N = 2000010, MOD = 998244353, INF = 0x3f3f3f3f;
int n, m, w[N];

int a[N], b[N];
void solve() {
    set<int> st;
    for (int i = 1; i <= 333; i++) st.insert(i * i);
    scanf("%d", &n);
    printf("%d\n", n * 2 - 3);
    int idx = 0;
    for (int i = 2; i < n + 1; i++) printf("%d %d %d\n", i - 1, i, 1), a[i] = ++idx;
    for (int i = 3; i < n + 1; i++) printf("%d %d %d\n", i - 1, i, i & 1 ? 3 : 2), b[i] = ++idx;
    for (int i = 1; i < n + 1; i++)
        for (int j = i + 1; j < n + 1; j++) {
            auto g = st.lower_bound(j - i);
            int c = (*g - (j - i));
            printf("%d ", j - i);
            int sum = 0;
            for (int k = i + 1; k <= j; k++) {
                if (c && k != 2) {
                    if (c > 1 && (k & 1)) c -= 2, printf("%d ", b[k]), sum += 3;
                    else if ((k & 1 ^ 1) && (c & 1)) c--, printf("%d ", b[k]), sum += 2;
                    else printf("%d ", a[k]), sum++;
                } else printf("%d ", a[k]), sum++;
            }
            puts("");
            assert(st.count(sum) && c == 0);
        }
}

int main() {
    int T = 1;
    // cin >> T;
    while (T--) solve();
    return 0;
}