//  ↘ ⬇ ⬇ ⬇ ⬇ ⬇ ↙
//  ➡ @roadfromroi ⬅
//  ↗ ⬆ ⬆ ⬆ ⬆ ⬆ ↖
#include <iostream>
#include "vector"
#include "algorithm"
#include "numeric"
#include "climits"
#include "iomanip"
#include "bitset"
#include "cmath"
#include "map"
#include "deque"
#include "array"
#include "set"
#include "prize.h"
#define all(x) x.begin(), x.end()
using namespace std;

int isgd(int n, long long val) {
    return val > 100;
}
map<int, vector<int>> mem;
vector<int> ask2(int i) {
    if (mem.find(i) == mem.end())
        mem[i] = ask(i);
    return mem[i];
}
int gtipe(int i) {
    vector<int> ab = ask2(i);
    return ab[0] + ab[1];
}
int find_best(int n) {
    mem.clear();
    int nrgt = 0;
    set<int> elemba;
    set<int> a;
    int vov = 0;
    int bgtp = 0;
    for (int i = 0; i < min(n, 500); ++i) {
        vector<int> ab = ask2(i);
        int vl = ab[0] + ab[1];
        if (vl == 0)
            return i;
        if (a.empty() or *a.rbegin() <= vl) {
            vov = i;
            bgtp = vl;
            nrgt = ab[1];
            if (isgd(n, vl))
                break;
        }
        a.insert(vl);
    }
    while (1) {
        bool gd = 1;
        for (int i = 512; i >= 1; i /= 2) {
            if (vov + i < n) {
                vector<int> ab = ask2(vov + i);
                if (ab[0] + ab[1] == bgtp) {
                    if (ab[1] == nrgt) {
                        vov += i;
                        if (i == 512) {
                            gd = 0;
                            break;
                        }
                    }
                }
                if (ab[0] + ab[1] == 0) {
                    return vov + i;
                }
            }
        }
        if (gd) {
            vov++;
            while (gtipe(vov) != bgtp) {
                if (gtipe(vov) == 0)
                    return vov;
                vov++;
            }
            nrgt = ask2(vov)[1];
        }
    }
}
/*
static const int max_q = 10000;
static int n;
static int query_count = 0;
static vector<int> g;
static vector<vector<int> > rank_count;

vector<int> ask(int i) {
    query_count++;
    if(query_count > max_q) {
        cerr << "Query limit exceeded" << endl;
        exit(0);
    }

    if(i < 0 || i >= n) {
        cerr << "Bad index: " << i << endl;
        exit(0);
    }

    vector<int> res(2);
    res[0] = rank_count[g[i] - 1][i + 1];
    res[1] = rank_count[g[i] - 1][n] - res[0];
    return res;
}

int main() {
    cin >> n;

    g.resize(n);
    for(int i = 0; i < n; i++) {
        if (i == n-1)
            g[i] = 1;
        else
            g[i] = 2;
        //cin >> g[i];
        if(g[i] < 1) {
            cerr << "Invalid rank " << g[i] << " at index " << i << endl;
            exit(0);
        }
    }

    int max_rank = *max_element(g.begin(), g.end());

    rank_count.resize(max_rank + 1, vector<int>(n + 1, 0));
    for(int r = 0; r <= max_rank; r++) {
        for(int i = 1; i <= n; i++) {
            rank_count[r][i] = rank_count[r][i - 1];
            if(g[i - 1] == r)
                rank_count[r][i]++;
        }
    }

    for(int i = 0; i <= n; i++)
        for(int r = 1; r <= max_rank; r++)
            rank_count[r][i] += rank_count[r - 1][i];

    int res = find_best(n);
    cout << res << endl << "Query count: " << query_count << endl;

    return 0;
}
*/