#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define x first
#define y second 
//#define endl '\n'
const LL maxn = 4e05+7;
const LL N=1e05+10;
const LL mod=1e09+7;
typedef pair<int,int>pl;
priority_queue<LL , vector<LL>, greater<LL> >t;
priority_queue<LL> q;
LL gcd(LL a, LL b){
	return b > 0 ? gcd(b , a % b) : a;
}

LL lcm(LL a , LL b){
	return a / gcd(a , b) * b;
}
int n , m;
int a[N];
void init(int n){
	for(int i = 0 ; i <= n ; i ++){
		a[i] = 0;
	}
}
void solve() 
{
	int n;
	cin >> n;
	cout<<"? 1"<<endl;
	int x;
	cin >> x;
	int prex = x;
	if(x == 0){
		cout<<"! 1"<<endl;
		return;
	}
	if(x == 1 && n == 2){
		cout<<"! 2"<<endl;
	}
	int l = 1 , r = n;
	while(1){
		int mid = (l + r) / 2;
		cout<<"? "<<mid<<endl;
		cin >> x;
		if(x == prex){
			cout<<"! " <<mid<<endl;
			return;
		}
		else if(x < prex){
			r = mid - 1;
		}
		else{
			l = mid + 1;
		}
		prex = x;
	}
}            
int main() 
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout.precision(10);
    int t=1;
//	cin>>t;
    while(t--)
    {
    	solve();
    }
    return 0;
}