import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } int Ask(int x, int y) { writeln("? ", x + 1, " ", y + 1); stdout.flush; const res = readInt() - 1; return res; } void Answer(int x) { import core.stdc.stdlib; writeln("! ", x + 1); stdout.flush; exit(0); } int N; void main() { N = readInt(); auto xs = iota(N).array; foreach (i; 0 .. N - 1) { const res = Ask(xs[2 * i], xs[2 * i + 1]); xs ~= res; } debug { writeln(xs); } const win = xs[$ - 1]; int[] ys; foreach (i; 0 .. N - 1) { if (xs[2 * i] == win) { ys ~= xs[2 * i + 1]; } else if (xs[2 * i + 1] == win) { ys ~= xs[2 * i]; } } const len = cast(int)(ys.length - 1); foreach (j; 0 .. len - 1) { const res = Ask(ys[2 * j], ys[2 * j + 1]); ys ~= res; } Answer(ys[$ - 1]); }