#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;

template <typename T1, typename T2>
string print_iterable(T1 begin_iter, T2 end_iter, int counter) {
    bool done_something = false;
    stringstream res;
    res << "[";
    for (; begin_iter != end_iter and counter; ++begin_iter) {
        done_something = true;
        counter--;
        res << *begin_iter << ", ";
    }
    string str = res.str();
    if (done_something) {
        str.pop_back();
        str.pop_back();
    }
    str += "]";
    return str;
}

vector<int> SortIndex(int size, std::function<bool(int, int)> compare) {
    vector<int> ord(size);
    for (int i = 0; i < size; i++) ord[i] = i;
    sort(ord.begin(), ord.end(), compare);
    return ord;
}

template <typename T>
bool MinPlace(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool MaxPlace(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename Container>
int SZ(const Container& S) { return S.size(); }

template <typename S, typename T>
ostream& operator <<(ostream& out, const pair<S, T>& p) {
    out << "{" << p.first << ", " << p.second << "}";
    return out;
}

template <typename T>
ostream& operator <<(ostream& out, const vector<T>& v) {
    out << "[";
    for (int i = 0; i < (int)v.size(); i++) {
        out << v[i];
        if (i != (int)v.size()-1) out << ", ";
    }
    out << "]";
    return out;
}

#if DEBUG && !ONLINE_JUDGE
    ifstream input_from_file("input.txt");
    #define cin input_from_file

    #define dbg_var(x) clog << #x  << ": " << x << endl;
    #define dbg_array(x, len) clog << #x << ": " << print_iterable(x, x+len, -1) << endl;
#else
    #define dbg_var(x)
    #define dbg_array(x, len)
#endif

///////////////////////////////////////////////////////////////////////////
//////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
///////////////////////////////////////////////////////////////////////////

const int MAXN = -1;

vector<vector<int>> aa, ww;

void solve(int L) {
    if (L == 1) {
        aa.push_back({});
        ww.push_back({});
        return;
    }
    solve(L/2);
    for (auto& vec : ww) for (auto& w : vec) w *= 2;
    int sz = aa.size();
    if (L % 2 == 0) {
        aa[sz-1].push_back(sz);
        aa[sz-1].push_back(sz);
        ww[sz-1].push_back(0);
        ww[sz-1].push_back(1);
        aa.push_back({});
        ww.push_back({});
    } else {
        aa[sz-1].push_back(sz);
        aa[sz-1].push_back(sz);
        ww[sz-1].push_back(0);
        ww[sz-1].push_back(1);
        aa[0].push_back(sz);
        ww[0].push_back(L-1);
        aa.push_back({});
        ww.push_back({});
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); // Remove in problems with online queries!
    int L;
    cin >> L;
    solve(L);
    int N = aa.size();
    int M = 0;
    for (int i = 0; i < N; i++) M += aa[i].size();
    cout << N << " " << M << "\n";
    for (int v = 0; v < N; v++) {
        for (int i = 0; i < (int)aa[v].size(); i++) {
            cout << v+1 << " " << aa[v][i]+1 << " " << ww[v][i] << "\n";
        }
    }
}


Measured memory_bytes: 256