#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	const int L = 40;
	long long A;
	cin >> A;
	int N = L * 3 + 1;
	vector<int> a, b;
	int M = 0;
	a.push_back(0);
	b.push_back(1);
	M++;
	a.push_back(0);
	b.push_back(2);
	M++;
	for (int i = 0; i < L - 1; i++) {
		for (int j = 0; j < 2; j++) {
			for (int k = 0; k < 2; k++) {
				int x = i * 3 + 1 + j;
				int y = i * 3 + 4 + k;
				a.push_back(x);
				b.push_back(y);
				M++;
			}
		}
		a.push_back(i * 3 + 3);
		b.push_back(i * 3 + 6);
		M++;
	}
	for (int i = 0; i < L; i++) {
		if ((A >> i & 1) == 1) {
			a.push_back(i * 3 + 2);
			b.push_back(i * 3 + 3);
			M++;
		}
	}
	cout << N << ' ' << M << endl;
	for (int i = 0; i < M; i++) {
		cout << a[i] + 1 << ' ' << b[i] + 1 << endl;
	}
}