#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
auto query(int n) {
	cout << "? " << n << endl;
	fflush(stdout);
	int get; cin >> get;
	return get;
}
void answer(int l, int r) {
	cout << "! " << l << " " << r << endl;
	fflush(stdout);
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	int sl = query(1);
	sl = sl * 2 - 1;
	int sr = query(n - 1);
	sr = sr * 2 - (n - 1);
	if (sl == sr) {
		answer(2, n - 1);
		return 0;
	}
	int type = 1;//sl = 1
	if (sl < 0)type = -1;
	int l = 1;
	int r = n - 1;
	while (1 < abs(r - l)) {
		int c = (l + r) / 2;
		int get = query(c);
		get = get * 2 - c;
		if (0 == get) {
			l = c, r = c;
		}
		else if (get * type < 0)r = c;
		else l = c;
	}
	if (l >= (n / 2))answer(1, l);
	else answer(l + 1, n);
	return 0;
}