import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;

enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;

alias Edge = Tuple!(int, "from", int, "to", int, "cost");

void main() {
    int L;
    scan(L);

    auto N = bitlen(L);
    Edge[] es;
    foreach (i ; 0 .. N - 1) {
        es ~= Edge(i, i + 1, 0);
        es ~= Edge(i, i + 1, 1 << (N - 2 - i));
    }

    foreach (i ; 0 .. N - 1) {
        if (L & (1 << i)) {
            auto mask = (1 << (i + 1)) - 1;
            mask = ~mask;
            auto c = L & mask;
            es ~= Edge(0, N - 1 - i, c);
        }
    }

    auto M = es.length;

    writefln("%s %s", N, M);
    es.each!(e => writefln("%s %s %s", e.from + 1, e.to + 1, e.cost));
}

int bitlen(int x) {
    return x > 0 ? bitlen(x >> 1) + 1 : 0;
}




void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;

    foreach (arg; args) {
        if (x > arg) {
            x = arg;
            isChanged = true;
        }
    }

    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;

    foreach (arg; args) {
        if (x < arg) {
            x = arg;
            isChanged = true;
        }
    }

    return isChanged;
}
