#include "richest.h"
#include <bits/stdc++.h>
#define sz(a) ((int)(a).size())
using namespace std;
const int N = 1e6 + 5;
int l[N], r[N];
int richest(int n, int t, int s) 
{
    if(t == 1) 
    {
        vector<int> a, b, c(n);
        for(int i = 0; i < n; i++) for(int j = i + 1; j < n; j++) a.push_back(i), b.push_back(j);
        auto t = ask(a, b);
        for(auto u: t) if((++c[u]) == n - 1) return u;
        return 0;
    }
    vector<int> a(n); r[0] = -1;
    for(int i = 0; i < n; i++) a[i] = i;
    auto work = [&](int m) 
    {
        int ct = 0, x = sz(a) / m, y = sz(a) % m;
        for(int i = 1; i <= m - y; i++) ct++, l[ct] = r[ct - 1] + 1, r[ct] = l[ct] + x - 1;
        for(int i = 1; i <= y; i++) ct++, l[ct] = r[ct - 1] + 1, r[ct] = l[ct] + x;
        vector<int> b, d, c(n);
        for(int i = 1; i <= ct; i++) 
        {
            for(int j = l[i]; j <= r[i]; j++)
            {
                for(int k = j + 1; k <= r[i]; k++) 
                {
                    b.push_back(a[j]);
                    d.push_back(a[k]);
                }
            }
        }
        auto t = ask(b, d);
        for(auto u: t) c[u]++;
        vector<int> a2;
        for(int i = 1; i <= ct; i++) 
            for(int j = l[i]; j <= r[i]; j++) 
                if(c[a[j]] == r[i] - l[i]) a2.push_back(a[j]);
        a.swap(a2);
    };
    work(500000), work(250000), work(125000), work(62500), work(20833), work(3472), work(183), work(1);
    return a[0];
}