#include<bits/stdc++.h>
#include "richest.h"
using namespace std;
const int N=1e6+5;
int n,A[N],Cnt;
int num[35]={500000,250000,125000,62500,20833,3472,183,1};
int richest(int n,int s,int t){
    vector<int>a,b,c;
    if(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);
        }
        c=ask(a,b);
        vector<int>rd(n,0);
        for(int i=0;i<499500;++i){
            if(c[i]==a[i])++rd[b[i]];
            else ++rd[a[i]];
        }
        for(int i=0;i<n;++i)if(!rd[i])return i;
    }
    vector<int>p(n);
    for(int i=0;i<n;++i)p[i]=i;
    for(int i=0;i<8;++i){
        a.clear(),b.clear();
		for(int j=0;j<(int)p.size();++j){
			for(int k=j%num[i];k<j;k+=num[i])if(j!=k)a.push_back(p[j]),b.push_back(p[k]);
		}
        vector<int>c=ask(a,b),q,rd(n,0);
        for(int j=0;j<(int)c.size();++j){
            if(c[j]==a[j])++rd[b[j]];
            else ++rd[a[j]];
        }
        for(int j=0;j<(int)p.size();++j)if(!rd[p[j]])q.push_back(p[j]);
        p=q;
	}
    return p[0];
}