#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    map<int, ll> memo;
    auto ask_sum = [&](int k) -> ll{
        if(memo.count(k)) return memo[k];
        cout << "? " << k << endl;
        int ans; cin >> ans;
        memo[k] = ans-(k-ans);
        return ans-(k-ans);
    };
    auto verify = [&](int l, int r){
        cout << "! " << l << ' ' << r << endl;
    };
    if(ask_sum(1) == ask_sum(n-1)){
        verify(1, n-1);
        return 0;
    }
    auto find_zero = [&](){
        int l = 1, r = n-1;
        while(true){
            int x = (l+r)/2;
            if(ask_sum(x) == 0) return x;
            if(ask_sum(l)*ask_sum(x) < 0){
                x = r;
            }else{
                assert(ask_sum(x)*ask_sum(r) < 0);
                l = x;
            }
        }
    };
    int idx = find_zero();
    if(idx == n/2){
        verify(1, n/2);
    }else if(idx > n/2){
        verify(2, idx);
    }else{
        verify(idx, n-1);
    }
}