#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair pii; typedef pair pll; const int INF = 1e9; const ll LINF = 1e18; template ostream& operator << (ostream& out,const pair& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template ostream& operator << (ostream& out,const vector V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template ostream& operator << (ostream& out,const vector > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template ostream& operator << (ostream& out,const map mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); ll l = 10, r = 1000000000+1; ll add = 0; { cout << "? " << 50 << endl; ll rep; cin >> rep; add++; if(rep == 0){ cout << "! 50" << endl; return 0; } if(rep == -1){ while(true){ cout << "? 0" << endl; ll rep; cin >> rep; if(rep == 0){ cout << "! " << add << endl; return 0; } add++; } } } while(r-l>1){ ll m = (l+r)/2; cout << "? " << m << endl; ll rep; cin >> rep; if(rep == 0){ cout << "! " << m+add << endl; return 0; } if(rep >= 0){ l = m; }else{ r = m; } if(l!=0)l--; if(r!=0)r--; add++; } cout << "! " << l+add << endl; return 0; }