#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cmath>

#define LL long long

using namespace std;

LL read() {
    LL x = 0, f = 1;
    char c = getchar();
    while(c < '0' || c > '9') {
        if(c == '-') f = -1;
        c = getchar();
    }
    while('0' <= c && c <= '9') {
        x = x * 10 + c - '0';
        c = getchar();
    }
    return x * f;
}

LL n, val[65], tmp[65], dv[65], maxdv, single;

int main() {
    n = read();
    val[1] = 1;
    int day = 0;
    while(val[1] * 2 + val[2] <= n) {
        ++day;
        for(int i = 1; i <= 60; ++i) tmp[i] = val[i];
        for(int i = 1; i <= 60; ++i) {
            if(i == 1) val[i] = tmp[i] * 2 + tmp[i + 1];
            else val[i] = tmp[i] + tmp[i + 1] + tmp[i - 1];
        }
    }
    LL rest = n;
    for(int i = 1; i <= 60; ++i) {
        dv[i] = rest / val[i];
        rest %= val[i];
        if(val[i] == 1) {single = dv[i]; break;}
        else maxdv = max(maxdv, dv[i]);
    }

    /*
        for(int i = 1; i <= 60; ++i) cout << val[i] << " ";
        cout << endl << endl;
        for(int i = 1; i <= 60; ++i) cout << dv[i] << " ";
        cout << endl;
    */

    LL C = 124 * maxdv + single, H = 0, D = day;
    printf("%d\n", C);
    for(int i = 1; i <= maxdv; ++i) {
        int y = i * 2 - 1;
        for(int x = -61; x <= 62; ++x) {
            if(x == 0 || x == 1) printf("%d %d 1\n", x, y);
            else printf("%d %d 0\n", x, y);
        }
    }
    for(int i = 1; i <= single; ++i) {
        int x = i * 2 - 1, y = -5;
        printf("%d %d 1\n", x, y);
    }

    for(int i = 1; i <= 60; ++i) H += dv[i];
    printf("%d %d\n", H, D);
    for(int i = 1; i <= 60; ++i) {
        if(val[i] == 1) break;
        for(int j = 1; j <= dv[i]; ++j) {
            int x = i, y = j * 2 - 1;
            printf("%d %d\n", x, y);
        }
    }
    for(int i = 1; i <= single; ++i) {
        int x = i * 2 - 1, y = -5;
        printf("%d %d\n", x, y);
    }

    return 0;
}