#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using VI = vector<int>;
using P = pair<int, int>;

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()

constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr int DX[] = {1, 0, -1, 0};
constexpr int DY[] = {0, 1, 0, -1};

template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }

const ll MOD = 1000000007;

int main() {
    int N, x, y;
    cin >> N;
    cout << "? 1" << endl;
    cin >> x;
    cout << "? " << N - 1 << endl;
    cin >> y;
    x = x - (1 - x);
    y = y - (N - 1 - y);
    if (x == y) {
        cout << "! 2 " << N - 1 << endl;
        return 0;
    }
    int a, b;
    if (x == 1) {
        a = N - 1;
        b = 1;
    } else {
        a = 1;
        b = N - 1;
    }
    while (true) {
        int c = (a + b) / 2;
        cout << "? " << c << endl;
        cin >> x;
        x = x - (c - x);
        if (x == 0) {
            if (c >= N / 2) {
                cout << "! 1 " << c << endl;
            } else {
                cout << "! " << c + 1 << " " << N << endl;
            }
            return 0;
        }
        if (x < 0) a = c;
        else b = c;
    }
}