#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

#define N 1000
#define MOD 1000000007
#define pen(str) return cout<<str<<endl,0
#define pex(str) {cout<<str<<endl;exit(0);}
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

int main(void){
	int min=1,max=1000000000;
	int z=12344;
	int k;
	while(min<=max){
		int mid=(min+max)/2;
		cout<<"? "<<mid<<endl;
		fflush(stdin);
		cin>>k;
		// cout<<max<<" "<<min<<endl;
		// if(mid<=z)k=1;else k=0;
		if(k)min=mid+1;
		else max=mid-1;
	}
	cout<<"! "<<(min+max)/2<<endl;
	return 0;
}