#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;

struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(15);
    }
} setup_io;

template <typename T>
inline bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
inline bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

// #include <boost/multiprecision/cpp_bin_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;

// #include <atcoder>
// using namespace atcoder;
// using mint = modint1000000007;
// using mint = modint998244353;

// const int MOD = 1000000007;
// const int MOD = 998244353;

int main() {
    int N;
    cin >> N;
    int query = 20;
    queue<int> que;
    que.push(N / 2);
    vector<tuple<int, int, int>> v;
    vector<int> seen(N);
    while (query--) {
        int s;
        if (que.empty()) {
            break;
        }
        int p = que.front();
        cout << "? " << p << endl;
        cin >> s;
        v.push_back({p, s, p - s});
        if (s != N / 2) {
            if (!seen[(N + p) / 2]) {
                que.push((N + p) / 2);
                seen[(N + p) / 2] = 1;
            }
        }
        if (p - s != 0) {
            if (!seen[p / 2]) {
                que.push(p / 2);
                seen[p / 2] = 1;
            }
        }
        que.pop();
    }
    sort(v.begin(), v.end());
    for (int i = 0; i < (int)v.size(); i++) {
        for (int j = i + 1; j < (int)v.size(); j++) {
            auto [a, b, c] = v[i];
            auto [x, y, z] = v[j];
            if (y - b == z - c) {
                cout << "! " << a << " " << x << endl;
                return 0;
            }
        }
    }
    return 0;
}