#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <map>
#include <cmath>
#include <cstring>
#include <vector>
#include <bitset>
#include <set>

template <typename Tp>
inline void read(Tp &x) {
    x = 0;
    bool f = true; char ch = getchar();
    for ( ; ch < '0' || ch > '9'; ch = getchar()) f ^= ch == '-';
    for ( ; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + (ch ^ 48);
    x = f ? x : -x;
}

const int N = 60;

int pos[N + 5];

struct Pair {
    int x, y, v;
};
std::vector<Pair> Vec;

int main() {
    long long X;
    read(X);
    Vec.push_back((Pair) {0, 0, 1});
    for (int i = 1; i <= N; ++i) {
        pos[i] = pos[i - 1] + i + 2;
        for (int j = 0; j <= i; ++j) {
            Vec.push_back((Pair) {pos[i] - i + j, j, 1});
            for (int k = pos[i] - i + j + 1; k <= pos[i]; ++k)
                Vec.push_back((Pair) {k, j, 0});
        }
        for (int j = 1; j <= N; ++j) Vec.push_back((Pair) {pos[i], -j, 0});
    }
    printf("%d\n", (int)Vec.size());
    for (Pair p : Vec) printf("%d %d %d\n", p.x, p.y, p.v);
    std::vector<std::pair<int, int> > v;
    if (X & 1) v.push_back(std::make_pair(0, 0));
    for (int i = 1; i <= N; ++i)
        if (X & (1LL << i)) v.push_back(std::make_pair(pos[i], i - N));
    printf("%d %d\n", (int)v.size(), N);
    for (auto p : v) printf("%d %d\n", p.first, p.second);
    return 0;
}