// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T& x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T& x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
signed main() {
	int n; cin >> n;
	if (n == 1) {
		puts("2 1\n1 2");
		return 0;
	}
	if (n == 2) {
		puts("4 4\n1 2\n2 3\n3 1\n3 4");
		return 0;
	}
	if (n <= 20) {
		cout << n << " " << n << endl;
		F(i, 1, n) cout << i << " " << i % n + 1 << endl;
		return 0;
	}
	F(x, 3, 20)
		F(y, 2, 20 - x)
			if (x * (x - 1) / 2 - 1 + y - 1 + 2 * (x - 1) == n) {
				// debug << x << " " << y << endl;
				cout << x + y << " " << x * (x - 1) / 2 + y + 1 << endl;
				F(i, 1, x)
					F(j, i + 1, x)
						cout << i << " " << j << endl;
				F(i, 1, y) cout << x + i - 1 << " " << x + i << endl;
				cout << 1 << " " << x + y << endl;
				return 0;
			}
	return 0;
}
/* why?
*/