#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cstdint>

using namespace std;
using i64 = int64_t;
using i32 = int32_t;
template<class T, class U> void init_n(vector<T>& v, size_t n, U x) 
{ v = vector<T>(n, x); }
template<class T> void init_n(vector<T>& v, size_t n) { init_n(v, n, T()); }
template<class T> void read_n(vector<T>& v, size_t n, size_t o = 0) 
{ v = vector<T>(n+o); for (size_t i=o; i<n+o; ++i) cin >> v[i]; }
template<class T> void read_n(T a[], size_t n, size_t o = 0)
{ for (size_t i=o; i<n+o; ++i) cin >> a[i]; }
template<class T> T gabs(const T& x) { return max(x, -x); }
#define abs gabs

i64 n;
pair<i64, vector<i64>> f(const vector<i64>& a) {
  vector<vector<i64>> w(n + 1);
  queue<i64> q;
  for (i64 x : a) q.push(x);
  while (q.size() >= 2) {
    i64 x = q.front(); q.pop();
    i64 y = q.front(); q.pop();
    cout << "? " << x << ' ' << y << endl;
    i64 z;
    cin >> z;
    if (y == z) swap(x, y);
    q.push(x);
    w[x].push_back(y);
  }
  return { q.front(), w[q.front()] };
}

int main() {
  cin >> n;
  vector<i64> a(n);
  iota(begin(a), end(a), 1);
  auto p = f(a);
  cerr << "first: " << p.first << endl;
  auto q = f(p.second);
  cout << "! " << q.first << endl;
  return 0;
}