//#include "gap.h"
//#include "mushrooms.h"
#include "insects.h"
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
//#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task2 "ftree"
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
#define getchar_unlocked getchar
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l,int r)
{
return uniform_int_distribution<int>(l,r)(rd);
}
void phongbeo();
const int inf = 1e16;
const ll mod2 = 1e9+7;
const ll base=67;
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int i, s10, s12,k1,k2,k3,s11,lim,w,l,r ;
int kk;
int t;
int el = 19;/*
main()
{
if(fopen(task2".inp","r"))
{
fin(task2);
fou(task2);
}
if(fopen(task".inp","r"))
{
fin(task);
fou(task);
}
ios_base::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
/// cin>>s1;
//int t;cin>>t; while(t--)
phongbeo();
// checktime
}
int c[1001];
int a[1001];
int d[1001];
void move_outside(int x)
{
c[a[d[x]]]--;
if(c[a[d[x]]]==0&&s2==a[d[x]])s2=a[d[x]]-1;
a[d[x]]--;
c[a[d[x]]]++;
}
void move_inside(int x)
{
dem2++;
c[a[d[x]]]--;
a[d[x]]++;
c[a[d[x]]]++;
if(a[d[x]]>s2)s2=a[d[x]];
}
int press_button()
{
return s2;
}
bool use[1001];*/
bool use[2001];
int haha[2001];
vector<int> rollback,v;
void roll()
{
for(auto x:rollback)
move_outside(x);
rollback.clear();
}
bool check(int x)
{
int s=0;
roll();
for(int i=0; i<n; i++)
{
if(haha[i]>=x+1)
{
continue;
}
else
{
move_inside(i);
if(press_button()==x+1)
{
move_outside(i);
haha[i]=x+1;
}
else
{
s++;
rollback.pb(i);
}
}
if(s==dem*x) return 1;
}
return 0;
}
void solve(vector<int>&roll,vector<int>&v)
{
s8=v.size()/roll.size();
s8+=1;
s7=min(s7,s8);
if(s7==1) return;
if(roll.size()==1) return;
int mid=roll.size()/2;
for(int i=0; i<mid; i++)
move_inside(roll[i]);
vector<int> left,right;
for(auto x:v)
{
move_inside(x);
if(press_button()==2)left.pb(x);
else right.pb(x);
move_outside(x);
}
vector<int> low,high;
for(int i=0; i<roll.size(); i++)
{
if(i<mid)
{
move_outside(roll[i]);
low.pb(roll[i]);
}
else high.pb(roll[i]);
}
solve(low,left);
solve(high,right);
}
int min_cardinality(int N)
{
n=N;
for(int i=0; i<n; i++)
{
move_inside(i);
if(press_button()==2)
move_outside(i),v.pb(i);
else
{
dem++;
use[i]=1;
rollback.pb(i);
}
}
s7=n;
if(dem<35)
{
for(auto x:rollback)
move_outside(x);
solve(rollback,v);
return s7;
}
l=2;
r=n/dem;
while(l<=r)
{
int mid=l+r>>1;
if(check(mid))l=mid+1;
else r=mid-1;
}
return l-1;
}/*
void phongbeo()
{
for(int i=0; i<500; i++)
d[i]=1;
for(int i=500; i<1000; i++)
d[i]=2;
s3=min_cardinality(1000);
cout<<s3<<" "<<dem2;
}*/
