#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100010;
int n;
int a[N], s[N], la;
vector<pair<int, int>> e;

int main() {
	ios::sync_with_stdio(0); cin.tie(nullptr);
	cin >> n;
	if(n == 1) {
		cout << "2 1\n1 2\n"; return 0;
	}
	if(n == 2) {
		cout << "4 4\n1 2\n1 3\n2 3\n3 4\n"; return 0;
	}
	for(int i = 1; i <= n; i++) {
		if(1ll * i * (i - 1) / 2 == n) {
			cout << i << " " << 1ll * i * (i - 1) / 2 << "\n";
			for(int x = 1; x <= i; x++)
				for(int y = x + 1; y <= i; y++) {
					cout << x << " " << y << "\n";
				}
			return 0;
		}
	}
	for(int i = 3; i <= n; i++) {
		if(1ll * i * (i - 1) / 2 - 1 + n == n) {
			cout << i + 1 << " " << 1ll * i * (i - 1) / 2 + 2 << "\n";
			for(int x = 1; x <= i; x++)
				for(int y = x + 1; y <= i; y++) {
					cout << x << " " << y << "\n";
				}
			cout << 1 << " " << i + 1 << "\n";
			cout << i << " " << i + 1 << "\n";
			return 0;
		}
	}
	if(n <= 20) {
		cout << n << " " << n << "\n";
		for(int i = 1; i <= n; i++) {
			cout << i << " " << i % n + 1 << "\n";
		}
		return 0;
	}
	for(int t = n; t;) {
		if(t <= 7) {
			--t, a[++la] = 1;
			if(!t) break;
		}
		for(int i = n; i >= 3; i--) {
			if(1ll * i * (i - 1) / 2 + (i - 2) * 2 + 2 - 1 + 2 > t) continue;
			a[++la] = i, a[++la] = 1;
			t -= 1ll * i * (i - 1) / 2 + (i - 2) * 2 + 2 - 1;
			break;
		}
	}
	// for(int i = 1; i <= la; i++) cout << " " << a[i]; cout << "\n";
	for(int i = 1; i <= la; i++) s[i] = a[i] + s[i - 1];
	for(int i = 1; i <= la; i++) {
		for(int x = s[i - 1] + 1; x <= s[i]; x++)
			for(int y = x + 1; y <= s[i]; y++)
				e.push_back({x, y});
	}
	for(int i = 1; i <= la; i++) {
		if(i < la) {
			e.push_back({s[i], s[i] + 1});
		}
		else {
			e.push_back({s[i], 1});
		}
	}
	cout << s[la] << " " << e.size() << "\n";
	for(auto v : e) cout << v.first << " " << v.second << "\n";
	return 0;
}