#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=1e6+10;
 
int query(int x)
{
    printf("? %d\\n",x);fflush(stdout);scanf("%d",&x);return x;
}
void print(int x)
{
    printf("! %d\\n",x);
    fflush(stdout);
}
void solve()
{
    int n;scanf("%d",&n);
    int lst=0;
    int l=1,r=n;
    while(1)
    {
        int now=query(l);
        if(now==lst){print(l);return ;}
        l=l+1;
        lst=now;
        while(l<r)
        {
            int mid=l+r>>1;
            int now=query(mid);
            if(now==lst){print(mid);return ;}
            if(now>lst)
            {
                l=mid+1;lst=now;
            }
            else
            {
                r=mid-1;lst=now;break;
            }
        }
        if(l==r){print(l);return ;}
    }
}
int main()
{
    int T=1;
    while(T--)solve();
}