#define _CRT_SECURE_NO_WARNINGS #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define aLL(g) (g).begin(),(g).end() #define REP(i, x, n) for(int i = x; i < n; i++) #define rep(i,n) REP(i,0,n) #define F(i,j,k) fill(i[0],i[0]+j*j,k) #define P(p) cout<<(p)< vi; typedef vector vl; typedef vector vd; typedef pair pii; typedef pair pll; typedef long long ll; int dx[] = { 0,1,0,-1 }; int dy[] = { -1,0,1,0 }; int sttoi(std::string str) { int ret; std::stringstream ss; ss << str; ss >> ret; return ret; } bool sort_greater(const pair &a, const pair &b) { return a.second > b.second; } void solve() { int left = 1; int right = 1000000000; int mid; int cnt = 0; while (left - right > 1) { if (cnt > 100) { return; } mid = (left + right) / 2; cout << "? " << mid << endl; int n; cin >> n; if (n == 1) { left = mid; } else { right = mid; } cnt++; } cout << "! " << mid << endl; } int main() { solve(); return 0; }