#ifndef LOCAL_RUN
	#define NDEBUG
#endif
#ifdef GNU_DEBUG
	#define _GLIBCXX_DEBUG 1
	#define _GLIBCXX_DEBUG_PEDANTIC 1
	#define _GLIBCXX_SANITIZE_VECTOR 1
#endif
#include <bits/stdc++.h>
#include "richest.h"
#define mset(a, b) memset(&a, b, sizeof(a))
#define ALL(v) std::begin(v), std::end(v)
#define RANGE(a, l, r) (std::begin(a) + (l)), (std::begin(a) + ((r) + 1))
#define fir(i, a, b, ...) for (int i = (a), ##__VA_ARGS__; i <= (b); ++i)
#define firr(i, a, b, ...) for (int i = (a), ##__VA_ARGS__; i >= (b); --i)
#ifdef LOCAL_RUN
	template<class T> void dbgpr(const T& x) {std::cerr << x << std::endl;}
	template<class T, class... Args> void dbgpr(const T& x, const Args&... args) {std::cerr << x << ", ", dbgpr(args...);}
	template<class... Args> void dbgprint(const char* s, const Args&... args) {std::cerr << s << " = ", dbgpr(args...);}
	#define debug(...) dbgprint(#__VA_ARGS__, __VA_ARGS__)
	#define DEBUG if (true)
#else
	#define debug(...) void()
	#define DEBUG if (false)
#endif
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
template<class T> void rei(T& x) {
	bool f = false; int ch; x = 0;
	while (!isdigit(ch = getchar())) f = ch == '-';
	do x = x * 10 + (ch & 15); while (isdigit(ch = getchar()));
	if (f) x = -x;
}
template<class T1, class T2> bool cmax(T1& a, const T2& b) {return a < b ? a = b, true : false;}
template<class T1, class T2> bool cmin(T1& a, const T2& b) {return b < a ? a = b, true : false;}
using namespace std;

const int MAXN = 1e6 + 5;

void build(vector<int>& op1, vector<int>& op2, vector<int>& seq, int C) {
	assert((int)seq.size() >= C);
	vector<int> cur; cur.reserve(C);
	fir (i, 1, C) cur.push_back(seq.back()), seq.pop_back();
	fir (i, 0, C - 1) fir (j, i + 1, C - 1) {
		op1.push_back(cur[i]);
		op2.push_back(cur[j]);
	}
}
int recover(vector<int>& res, int C) {
	assert((int)res.size() >= C * (C - 1) / 2);
	vector<int> vec; vec.reserve(C * (C - 1) / 2);
	fir (i, 1, C * (C - 1) / 2) vec.push_back(res.back()), res.pop_back();
	sort(ALL(vec));
	int las = 0, now = 0;
	int mx = 0, mxi = 0;
	for (auto& it : vec) {
		if (it != las) las = it, now = 1;
		else now++;
		if (cmax(mx, now)) mxi = it;
	}
	return mxi;
}

vector<int> seq;
void oper(int A, int cnt, int B) {
	assert(A * cnt <= (int)seq.size() && ((int)seq.size() - A * cnt) % B == 0);
	vector<int> op1, op2;
	fir (asdf, 1, cnt) {
		build(op1, op2, seq, A);
	}
	while (seq.size()) {
		build(op1, op2, seq, B);
	}
	assert(seq.empty());
	vector<int> res = ask(move(op1), move(op2));
	reverse(ALL(res));
	fir (asdf, 1, cnt) {
		int cur = recover(res, A);
		seq.push_back(cur);
	}
	while (res.size()) {
		int cur = recover(res, B);
		seq.push_back(cur);
	}
}

int richest(int n, int, int) {
	seq.resize(n), iota(ALL(seq), 0);
	if (n == 1000) {
		oper(0, 0, 1000);
	} else {
		oper(0, 0, 2);
		oper(0, 0, 2);
		oper(0, 0, 2);
		oper(0, 0, 2);
		oper(4, 1, 3);
		oper(7, 1, 6);
		oper(18, 5, 19);
		oper(0, 0, 183);
	}
	assert((int)seq.size() == 1);
	return seq[0];
}