from strutils import parseInt
from sequtils import mapIt, newSeqWith
from algorithm import binarySearch

var askCount = 0
proc ask(x, y: int): int =
  askCount.inc
  if askCount > 334:
    echo "! ", x
    quit()
  echo "? ", x, " ", y
  result = stdin.readLine.parseInt

proc ans(x: int) =
  echo "! ", x


let N = stdin.readLine.parseInt

var histories = newSeqWith(30, newSeq[int]())
histories[0] = (1..N).mapIt(it)

for h in 0..<25:
  if histories[h].len <= 1: break
  for i in countup(1, histories[h].high, 2):
    histories[h + 1].add(ask(histories[h][i - 1], histories[h][i]))
  if histories[h].len mod 2 == 1:
    histories[h + 1].add(histories[h][^1])

var
  results = newSeq[int]()
  max: int
for h in countdown(20, 0):
  if histories[h].len == 0:
    continue
  if histories[h].len == 1:
    max = histories[h][0]
    continue
  let i = histories[h].binarySearch(max)
  if i mod 2 == 0:
    if i + 1 <= histories[h].high: results.add(histories[h][i + 1])
  else:
    if i - 1 <= 0: results.add(histories[h][i - 1])

while results.len > 1:
  var next = newSeq[int]()
  for i in countup(1, results.high, 2):
    next.add(ask(results[i - 1], results[i]))
  if results.len mod 2 == 1:
    next.add(results[^1])
  results = next

ans(results[0])