#include <bits/stdc++.h>

using namespace std;

const int NMAX = 100;

vector <int> edges[NMAX + 1];
int indegree[NMAX + 1];

bool viz[NMAX + 1];

int query( int x ) {
    cout << "? " << x << endl;
    cin >> x;
    return x;
}
int cb( int st, int dr ) {
    int mij;
    while ( st < dr - 1 ) {
        mij = ( st + dr ) / 2;
        if ( query( mij ) == 0 ) {
            st = mij;
        } else
            dr = mij;
    }
    return dr;
}

int main () {
    int n;
    cin >> n;

    cout << "! " << cb( 0, n ) << endl;
    return 0;
}