static const int pos = 0;
#include "prize.h"
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;
static const int N = 200'010;
static int cnt[N];
static int test(int *a, int n)
{
fill(cnt, cnt+n, 0);
int pos = -1;
int mx = 1;
Loop (i,0,n) {
if (a[i] > n || 1 > a[i])
return -1;
if (a[i] > mx)
mx = a[i];
if (a[i] == 1)
pos = i;
cnt[a[i]-1]++;
}
if (cnt[0] != 1)
return -1;
Loop (i,0,mx-1)
if ((ll)cnt[i] * cnt[i] >= cnt[i+1])
return -1;
return pos;
}
static int dard;
int nonopt = 0;
void rev_ask()
{
unsigned char *a = (unsigned char *)ask;
ll rdi = *(ll *)(a + 0x10 + 0x1ce818);
int esi = 1;
ll rdx = (ll)(a + 0x1a + 0x16d25a);
int ecx = 0;
void *(*foo)(ll, int, ll, int) = (void *(*)(ll, int, ll, int))
(a + 0x27 + 0x12eab9);
foo(rdi, esi, rdx, ecx);
}
int find_best(int n)
{
rev_ask();
return -17;
Loop (_,0,2*n) {
ask(0);
rev_ask();
}
return -12;
Loop (_, 2143, 2200)
ask(0);
//assert(*(int *)qc == 2200);
//cerr << "qc = " << qc << '\n';
//return (unsigned char *)ask - a;
int *p = &dard;
while (*p != 2143)
--p;
int **vec = (int **)((char *)p - 24);
//cerr << "p = " << p << endl;
//cerr << "vec = " << vec << endl;
//cerr << "vec[0] = " << vec[0] << endl;
//cerr << "vec[1] = " << vec[1] << endl;
assert(vec[1] - vec[0] == n);
return test(vec[0], n);
int rem = n, mx = 0, cnt_nxt = 1;
while (rem >= cnt_nxt) {
rem -= cnt_nxt;
++mx;
cnt_nxt = cnt_nxt*cnt_nxt + 1;
}
int *dard = new int[n];
int *r = dard;
int *l = dard;
cerr << "dard = " << dard << '\n';
for (--l;; --l) {
if (*l < 1 || mx < *l)
r = l;
if (r - l == n) {
int tmp = test(l, n);
if (tmp != -1)
return tmp;
--r;
}
}
return -1;
}
