#include <bits/stdc++.h>
using namespace std;
#include "richest.h"
int richest(int n, int t, int s){
	vector<int> a,b,ret;
	if(t==1){
		assert(n==1000);
		for(int i=0; i<n; i++){
			for(int j=i+1; j<n; j++){
				a.push_back(i);
				b.push_back(j);
			}
		}
		ret=ask(a,b);
		int ans=0;
		for(int i=0; i<(int)ret.size(); i++){
			if(a[i]==ans) ans=ret[i];
		}
		return ans;
	}
	vector<int> alive,tmp;
	for(int i=0; i<n; i++) alive.push_back(i);
	int bucs[]={2,2, 2, 2, 3, 6, 19, 183},at=0;
	while((int)alive.size()>1){
		int m=alive.size();
		int buc=bucs[at];
		at++;
		int left=m%buc;
		int g1=(m+buc-1)/buc,g2=(left==0?0:(buc-1-left+1));
		g1-=g2;
		assert(g1>=0);
		assert(g1*buc+g2*(buc-1)==m);
		//cout << m << ' ' << buc << ' ' << g1 << ' ' << g2 <<'\n';
		//cout << buc << '\n';
		//cout << (m+buc-1)/buc*buc*(buc-1)/2 << '\n';
		a.clear(); b.clear();
		int cur=0;
		for(int i=0; i<g1; i++){
			for(int j=0; j<buc; j++){
				for(int k=j+1; k<buc; k++){
					if(cur+j>=m||cur+k>=m) continue;
					a.push_back(alive[cur+j]);
					b.push_back(alive[cur+k]);
				}
			}
			cur+=buc;
		}
		for(int i=0; i<g2; i++){
			for(int j=0; j<buc-1; j++){
				for(int k=j+1; k<buc-1; k++){
					if(cur+j>=m||cur+k>=m) continue;
					a.push_back(alive[cur+j]);
					b.push_back(alive[cur+k]);
				}
			}
			cur+=buc-1;
		}
		ret=ask(a,b);
		int cnt=0;
		cur=0;
		for(int i=0; i<g1; i++){
			int best=alive[cur];
			for(int j=0; j<buc; j++){
				for(int k=j+1; k<buc; k++){
					if(cur+j>=m||cur+k>=m) continue;
					if(a[cnt]==best) best=ret[cnt];
					cnt++;
				}
			}
			tmp.push_back(best);
			cur+=buc;
		}
		for(int i=0; i<g2; i++){
			int best=alive[cur];
			for(int j=0; j<buc-1; j++){
				for(int k=j+1; k<buc-1; k++){
					if(cur+j>=m||cur+k>=m) continue;
					if(a[cnt]==best) best=ret[cnt];
					cnt++;
				}
			}
			tmp.push_back(best);
			cur+=buc-1;
		}
		swap(tmp,alive);
		tmp.clear();
	}
	return alive[0];
}