#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>
#include <random>

#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;
}

template<typename T>
class Cumsum{
    public:
    Cumsum(vector<T> v): v(v){
        n = v.size();
        v_cumsum = vector<T>(n+1, T(0));
        for(int i = 0; i < n; i++) v_cumsum[i+1] = v_cumsum[i]+v[i];
    }
    /**
     * v[l] + ... + v[r-1]
     */ 
    T sum(int l, int r){
        if(r <= l) return T(0);
        if(r > n) r = n;
        if(l < 0) l = 0;
        return v_cumsum[r]-v_cumsum[l];
    }
    private:
    int n;
    vector<T> v;
    vector<T> v_cumsum;
};

class Simulator{
    public:
    int n;
    Simulator(int n): n(n) {
        n_asked = 0;
        v.resize(n);
        for(int i = 0; i < n/2; i++) v[i] = 1;
        random_device seed_gen;
        mt19937 engine(seed_gen());
        shuffle(v.begin(), v.end(), engine);
        cumsum = Cumsum<int>(v);
    }
    int asK(int k){
        n_asked++;
        return cumsum.sum(0, k);
    };
    void verify(int l, int r){
        print_vector(v);
        cout << l << ' ' << r << endl;
        int len = r-l+1;
        assert(len%2 == 0);
        assert(n_asked <= 20);
        int sum = cumsum.sum(l-1, r);
        debug_value(sum)
        assert(r-l+1 >= n/2);
        assert(sum == len/2);
    }
    private:
    int n_asked;
    vector<int> v;
    Cumsum<int> cumsum = Cumsum<int>(vector<int>(1));
};

// #define DEBUG

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
#ifdef DEBUG
    auto sim = Simulator(n);
#endif
    map<int, ll> memo;
    auto ask_sum = [&](int k) -> ll{
        if(memo.count(k)) return memo[k];
#ifdef DEBUG
        int ans = sim.asK(k);
#else
        cout << "? " << k << endl;
        int ans; cin >> ans;
#endif
        memo[k] = ans-(k-ans);
        return ans-(k-ans);
    };
    auto verify = [&](int l, int r){
#ifdef DEBUG
        sim.verify(l, r);
#else
        cout << "! " << l << ' ' << r << endl;
#endif
    };
    if(ask_sum(1) == ask_sum(n-1)){
        verify(2, 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){
                r = x;
            }else{
                assert(ask_sum(x)*ask_sum(r) < 0);
                l = x;
            }
        }
    };
    int idx = find_zero();
    assert(ask_sum(idx) == 0);
    // debug_value(idx);
    if(idx > n/2){
        verify(1, idx);
    }else{
        verify(idx+1, n);
    }
}