#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#include<regex>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define pb push_back
#define eb emplace_back
using ll=long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 50;
 
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
using namespace std;

int C(int mid){
    cout<<"? "<<mid<<endl;
    int res;
    cin>>res;
    return res;
}
void solve(){
    int l=10,r=1e9;
    int cnt=0;
    int x;
    rep(i,100){
        int mid=(l+r)/2;
        if(mid-cnt>=0)x=C(mid-cnt);
        else x=C(0);
        if(x==1)r=mid;
        else if(x==-1)l=mid;
        else {
            cout<<"! "<<mid<<endl;
            return ;
        }
        ++cnt;
    }
}
 
int main(){
	ios::sync_with_stdio(false);
    cin.tie(0);
	cout<<fixed<<setprecision(15);
	solve();
	return 0;
}