#include<bits/stdc++.h>
#define ll long long
#define endl '\n'
#define up(i,j,k,l) for(int i=j;i<=k;i+=l)
#define down(i,j,k,l) for(int i=j;i>=k;i-=l)
using namespace std;
extern "C" int Seniorious(int x);
extern "C" int Chtholly(int n,int c)
{
(void)c;
int res,t;
int l=1,r=n;
int mid;
while(l<r){
mid=(l+r)>>1;
t=Seniorious(mid);
if(t==0){
return mid;
}
else if(t==1){
l=mid+1;
res=mid;
}
else{
r=mid-1;
res=mid;
}
}
return res;
}
void solve()
{
return;
}
int main()
{
int _=1;
up(i,1,_,1){
solve();
}
return 0;
}