#pragma GCC optimize(3, "Ofast", "inline")
#include <iostream>
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
#define L_INF 0x7f3f3f3f3f3f3f3f
#define db cout << "debug\n";

using namespace std;
const int Mod = 998244353;
using ll = long long;
int fh = 0;
int print(int x)
{
    cout << "? " << x << endl;
    int c;
    cin >> c;
    return c - fh;
}
int f(int l, int r)
{
    // cout << l << ' ' << r << '\n';
    if (l == r)
        return l;
    int num = 0;
    int ttt = 1;
    int i;
    int nxt;
    for (i = l; i <= r; i += ttt)
    {
        ttt *= 2;
        // cout << l << ' ' << r << ' ' << i << ' ' << ttt << '\n';
        nxt = print(i);
        cout << nxt << ' ' << fh << '\n';
        num++;
        if (nxt == num)
            continue;
        else if (nxt == num - 1)
            return i;
        else
        {
            fh = nxt;
            // cout << "F" << fh << '\n';
            if (i - ttt / 2 + 1 <= i - 1)
                return f(i - ttt / 2 + 1, i - 1);
        }
    }
    // cout << i << ' ' << ttt << '\n';
    // if (i - ttt + 1 <= r)
    fh = nxt;
    return f(i - ttt + 1, r);
}
void solve()
{
    int n;
    cin >> n;
    int res = f(1, n);
    cout << "! " << res << endl;
}
int main()
{
    // IOS;
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}