#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int query(int k) {
  cout << "? " << k << endl;
  int s; cin >> s;
  assert(s != -1);
  return s;
}

int main() {
  int n; cin >> n;
  const bool f = query(1) == 1, b = query(n - 1) == n / 2 - 1;
  if (f != b) {
    cout << "! " << 2 << ' ' << n - 1 << endl;
    return 0;
  }
  int lb = 1, ub = n - 1;
  while (ub - lb > 1) {
    const int mid = (lb + ub) / 2, q = query(mid);
    if (q == mid - q) {
      cout << "! ";
      if (mid < n / 2) {
        cout << mid + 1 << ' ' << n;
      } else {
        cout << 1 << ' ' << mid;
      }
      cout << endl;
      return 0;
    }
    (q > mid - q ? lb : ub) = mid;
  }
  cout << "! " << 1 << ' ' << n << endl;
  return 0;
}