#include "bits/stdc++.h"

using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif

#define int long long
#define ll long long
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define loop(n) rep(loop, (0), (n))
#define all(c) begin(c), end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using pii = pair<int, int>;
// template<class T> ostream &operator<<(ostream &os,T &t){dump(t);return os;}
template <typename T, typename S>istream &operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
//template <typename T, typename S>ostream &operator<<(ostream &os, pair<T, S> &p) {os << p.first << " " << p.second;return os;}

template <typename T> void printvv(const vector<vector<T>> &v) {
	cerr << endl;
	rep(i, 0, v.size()) rep(j, 0, v[i].size()) {
		if (typeid(v[i][j]).name() == typeid(INF).name() and v[i][j] == INF) {
			cerr << "INF";
		}
		else
			cerr << v[i][j];
		cerr << (j == v[i].size() - 1 ? '\n' : ' ');
	}
	cerr << endl;
}

#ifndef _DEBUG
#define printvv(...)
#endif
void YES(bool f) { cout << (f ? "YES" : "NO") << endl; }
void Yes(bool f) { cout << (f ? "Yes" : "No") << endl; }
template <class T, class U>bool chmin(T& a, U b) { if (a > b) { a = b; return true; }return false; }
template <class T, class U>bool chmax(T& a, U b) { if (a < b) { a = b; return true; }return false; }
using Weight = int;
using Flow = int;
struct Edge {
	int s, d; Weight w; Flow c; int id;
	Edge() {};
	Edge(int s, int d, Weight w = 1) : s(s), d(d), w(w), c(w) {};
};
bool operator<(const Edge &e1, const Edge &e2) { return e1.w < e2.w; }
bool operator>(const Edge &e1, const Edge &e2) { return e2 < e1; }
inline ostream &operator<<(ostream &os, const Edge &e) { return (os << '(' << e.s << ", " << e.d << ", " << e.w << ')'); }

using Edges = vector<Edge>;
using Graph = vector<Edges>;
using Array = vector<Weight>;
using Matrix = vector<Array>;

void addArc(Graph &g, int s, int d, Weight w = 1) {
	g[s].emplace_back(s, d, w);
}
void addEdge(Graph &g, int a, int b, Weight w = 1) {
	addArc(g, a, b, w);
	addArc(g, b, a, w);
}

signed main(signed argc, char *argv[]) {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(12);

	int L; cin >> L;

	int cnt = 0;
	int x = 0;
	while (L > ((x << 1) + 1)) {
		x <<= 1;
		x++;
		cnt++;
	}
	dump(x, cnt);

	int n = cnt + 1;
	Graph g(n);
	int a = 1;
	rrep(i, 1, n) {
		addArc(g, i - 1, i, a);
		addArc(g, i - 1, i, 0);
		a <<= 1;
	}

	auto check = [&]() {
		set<int>st;
		queue<pii>q;
		q.push(pii(0, 0));
		while (q.size()) {
			pii p = q.front(); q.pop();
			if (g[p.first].empty()) {
				if (not st.count(p.second));
				st.insert(p.second);
			}
			else {
				for (auto e : g[p.first]) {
					q.push(pii(e.d, p.second + e.w));
				}
			}
		}
		dump(st);
	};
	check();

	int w = 1ll << cnt;
	rrep(i, 0, cnt) {
		if ((L >> i) & 1) {
			dump(n - 1 - i, w);
			addArc(g, 0, n - 1 - i, w);
			w += 1ll << i;
			dump(w);
		}
	}
	//addArc(g, 0, n - 1, w);
	check();

	int m = accumulate(all(g), 0, [](int a, Edges b) {return a + b.size(); });

	cout << g.size() << " " << m << endl;

	for (auto es : g) {
		for (auto e : es) {
			cout << e.s + 1 << " " << e.d + 1 << " " << e.w << endl;
		}
	}

	return 0;
}


Measured memory_bytes: 47836