#include <bits/stdc++.h>
using namespace std;

using ll = long long;
ll a[10000], b[10000];

void init(int n) {
    a[n] = 1;
    for (int i = 1; i <= n; i++) {
        for (int j = n - i; j <= n + i; j++)
            b[j] = a[j - 1] + a[j] + a[j + 1];
        for (int j = n - i; j <= n + i; j++)
            a[j] = b[j];
    }
}

int main() {
    int days = 40, num = 40;

    init(days);
    cout << num * (days * 2 + 1) << "\n";
    for (int i = 1; i <= num; i++) {
        int x = i * 2 - 1;
        for (int y = -days; y <= days; y++)
            cout << x << " " << y << " " << !y << "\n";
    }

    ll N;
    cin >> N;
    vector<tuple<ll, int, int>> res;
    for (int i = 1; i <= num; i++) {
        int x = i * 2 - 1;
        for (int y = -days; y <= days; y++)
            res.emplace_back(a[y + days], x, y);
    }
    sort(begin(res), end(res), greater<>());
    vector<pair<int, int>> ans;
    for (auto [val, x, y]: res) {
        if (N >= val) {
            N -= val;
            ans.emplace_back(x, y);
        }
    }
    assert(N == 0);
    cout << ans.size() << " " << days << "\n";
    for (auto [x, y]: ans)
        cout << x << " " << y << "\n";
}