#include <bits/stdc++.h>
using namespace std;
#define rep(i, d, u) for(int i = d; i <= u; ++i)
#define dep(i, u, d) for(int i = u; i >= d; --i)
#define cep(n) while(n--)
#define gep(i, a) for(int i = firs[a]; i; i = neig[i])
int ured() {
	int re = 0;
	char ch;
	do {
		ch = getchar();
	} while('9' < ch || ch < '0');
	do {
		re = re * 10 + (ch ^ '0');
	} while('0' <= (ch = getchar()) && ch <= '9');
	return re;
}
void uwit(int da) {
	int ch[21], cn = 0;
	do {
		ch[++cn] = da - da / 10 * 10;
	} while(da /= 10);
	do {
		putchar('0' ^ ch[cn]);
	} while(--cn);
}
const int _maxn = 1000011;
int n, efle, efri, efmi, efan, lans, rans, tans, matp;
vector<int> rest, cpys;
int quer(int at) {
	putchar('?'), putchar(' '), uwit(at), putchar('\n'), fflush(stdout);
	return ured();
}
int main() {
	n = ured();
	rep(i, 1, n) {
		rest . push_back(i);
	}
	while(rest . size()) {
		if((lans = quer(rest[0])) == tans) {
			putchar('!'), putchar(' '), uwit(rest[0]), putchar('\n'), fflush(stdout);
			return 0;
		}
		if((rans = quer(rest[matp = rest . size() >> 1])) == lans) {
			putchar('!'), putchar(' '), uwit(rest[0]), putchar('\n'), fflush(stdout);
			return 0;
		}
		cpys = rest, rest . clear();
		if(rans == tans) {
			rep(i, 1, matp - 1) {
				rest . push_back(cpys[i]);
			}
		} else {
			rep(i, matp + 1, cpys . size() - 1) {
				rest . push_back(cpys[i]);
			}
		}
		tans = rans;
	}
	return 0;
}