#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll K,a,b,l,r;
int tt,ct,op[2005];
mt19937_64 rng(time(0));
bool slv(ll x,ll y) {
	tt = ct = 0;
	bool f = 0;
	while (1) {
		if (x == y) {
			if (x == 1) f = 1;
			break;
		}
		++ tt;
		if (x > y) x -= y,op[tt] = 1; 
		else y -= x,op[tt] = -1,ct ++;
		if (tt > 99) return 0;
//		cout << x << " " << y << endl;
	}
//	cout << tt << endl;
	if (!f) return 0;
	int m = 2;
	printf("%d %d\n1 2\n",2 + ct,1 + tt);
	for (int i = tt; i > 0; i --)
		if (op[i] == 1) printf("1 %d\n",m);
		else printf("%d %d\n",m,m + 1),m ++;
	return 1;
}
int main() {
	scanf("%lld",&K);
	if (K == 1) {
		printf("1 0");
		return 0;
	}
	a = K;
	l = K * 0.6,r = min(K,l + 1000000);
	while (1) {
		b = rng() % K + 1;
//		cout << b << endl;
//		cout << b << " ";
//		cout << l << " " << b << " " << r << endl;
		if (slv(a,b))  break;
	}
	return 0;
}