#include <bits/stdc++.h>
#define dbg(x) cerr << #x << ':'<< (x) << endl;
#define ALL(x) x.begin(),x.end()
using namespace std;
using ll = long long;
using ld = long double;

int main() {
    const int block = 450;
    int n;
    cin >> n;
    map<int, int> mp;
    int base;
    cout << "? " << n << " " << 1 << endl;
    cin >> base;
    mp[base] = 0;
    int t = 0;
    for (int i = 1; i < block; ++i)
    {
        cout << "? " << i << ' ' << base << endl;
        int id;
        cin >> id;
        if (id == base)
        {
            t = i;
            break;
        }
        mp[id] = i;
    }
    if (t == 0)
    {
        for (int i = 1; i * block <= n; ++i)
        {
            int tmp = i * block;
            cout << "? " << tmp << ' ' << base << endl;
            int id;
            cin >> id;
            if (mp.find(id) != mp.end())
            {
                t = tmp - mp[id];
                break;
            }
        }
    }
    
    int tmp = -base;
    while (tmp <= 0) tmp += t;
    cout << "? " << tmp << ' ' << base << endl;
    int ans_r;
    cin >> ans_r;
    // cout << "? " << base << ' ' << ans_r << endl;
    cout << "! " << base << ' ' << ans_r << endl;
    
}