#include<iostream>
#include<math.h>
#include<vector>
#include<unordered_map>
#include<algorithm>
#include<queue>
#include<string.h>
#include<stack>
#define ll long long
using namespace std;
int a[100010];
int b[100010];

void solve() 
{
	int n;
    cin>>n;
    int l=1,r=n;
    int res1=0;
    int res2=0;
    int len=0;
    int ans[50];
    while(1)
    {
        int mid =(l+r)>>1;
        cout<<"? "<<mid<<endl;
        ++len;
        cin>>ans[len];
        if(len==1)
        {
            if(ans[len]==0)
            {
                cout<<"! "<<mid<<endl;
                break;
            }
            else if(ans[len]>0)
            {
                l=mid+1;
            }
            else 
            {
                r=mid-1;
            }
            continue;
        }
        if(ans[len]==ans[len-1])
        {
            cout<<"! "<<mid<<endl;
            break;

        }
            
        else if(ans[len]>ans[len-1])
        {
            l=mid+1;
        }
        else
        {
            r=mid-1;
        }
    }


}  

int main()
{
    
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout.precision(10);
    int t;
    t=1;
    while(t>0)
    {
        t--;
        solve();
    }
    return 0;
}