#include <bits/stdc++.h>

using namespace std;

int N; 

int Q(int r, int c) {
    if (c == 0) return r;
    if (c > N) {
        r = Q(r, N);
        return Q(r, c - N);
    } else {
        cout << "? " << c << " " << r << endl;
        int a;
        cin >> a;
        return a;
    }
}

int main() {
    cin >> N;
    int r = Q(1, N);

    vector<pair<int, int>> ev;
    int s = sqrt(N) + 1;
    for (int i = 0; i < s; i++)
    {
        ev.push_back({Q(r, s - i), s - i});
        ev.push_back({Q(r, s + i * s), s + i * s});
    }
    
    sort(ev.begin(), ev.end());
    int d = -1;
    for (int i = 0; i < ev.size() - 1; i++)
    {
        if (ev[i].first == ev[i + 1].first && ev[i + 1].second - ev[i].second) d = ev[i + 1].second - ev[i].second;
    }
    
    int R = Q(r, d - (r % d));
    cout << "! " << r << " " << R << endl;
}