#include "prize.h"
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
using ll = long long;
vector<vector<int>> memo;
vector<int> Ask(int n) {
if (memo[n].empty()) memo[n] = ask(n);
return memo[n];
}
int find_best(int n) {
memo.resize(n);
{
int ok = 0, ng = n;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
if (Ask(mid)[0] >= 1) ng = mid;
else ok = mid;
}
return ok;
}
}
