#include <bits/stdc++.h>
int w[1000005];
std::vector<int> aask(std::vector<int> a, std::vector<int> b){
	std::vector <int> c; c.resize(a.size());
	for(int i = 0; i < a.size(); i++)
		if(w[a[i]] > w[b[i]]) c[i] = a[i];
		else c[i] = b[i];
	return c;
}
std::vector<int> ask(std::vector<int> a, std::vector<int> b);
using namespace std;
const int c[] = {1000000, 500000, 250000, 125000, 62498, 20832, 3472, 183, 1};
int v[1000005];
vector <int> t[500005];
int richest(int n, int T, int S){
	vector <int> a, b;
	if(n <= 1000){
		memset(v, 0, sizeof v);
		for(int i = 1; i <= n; i++) for(int j = i + 1; j <= n; j++) a.push_back(i - 1), b.push_back(j - 1);
		auto c = ask(a, b);
		for(int i: c) v[i + 1]++;
		for(int i = 1; i <= n; i++) if(v[i] == n - 1) return i - 1;
		assert(0);
	} vector <int> f;
	for(int i = 1; i <= n; i++) f.push_back(i);
	for(int i = 1; i <= 8; i++){
		for(int i: f) v[i] = 0;
		a.clear(), b.clear();
		int k = c[i - 1] / c[i], now = 0, cnt = 1;
		for(int j = 1; j <= c[i - 1] % c[i]; j++){
			t[++cnt].clear();
			for(int l = 0; l <= k; l++, now++) t[cnt].push_back(f[now]);
			for(int l = 0; l < t[cnt].size(); l++) for(int o = l + 1; o < t[cnt].size(); o++)
				a.push_back(t[cnt][l] - 1), b.push_back(t[cnt][o] - 1);
		}
		for(int j = 1; j <= c[i] - c[i - 1] % c[i]; j++){
			t[++cnt].clear();
			for(int l = 0; l < k; l++, now++) t[cnt].push_back(f[now]);
			for(int l = 0; l < t[cnt].size(); l++) for(int o = l + 1; o < t[cnt].size(); o++)
				a.push_back(t[cnt][l] - 1), b.push_back(t[cnt][o] - 1);
		}
		auto c = ask(a, b); vector <int> h = {};
		for(int j: c) v[j + 1]++;
		for(int j = 1; j <= cnt; j++)
			for(int l: t[j]) if(v[l] == t[j].size() - 1) h.push_back(l);
		f = h;
	} return f[0] - 1;
}
int maain(){
	int n, ans; cin >> n; mt19937 rnd(time(0));
	iota(w, w + n, 1), shuffle(w, w + n, rnd);
	for(int i = 0; i < n; i++) if(w[i] == n) ans = i;
	cout << richest(n, 114514, 1919810) << ' ' << ans;
	return 0;
}