#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int cnt = 0;

int query(int x, int y) {
  if (++cnt == 335) assert(false);
  cout << "? " << x + 1 << ' ' << y + 1 << endl;
  int ans; cin >> ans;
  return ans - 1;
}

int main() {
  int n; cin >> n;
  vector<vector<int>> loser(n);
  vector<int> par(n);
  iota(ALL(par), 0);
  function<int()> get_winner = [&]() {
    while (par.size() > 1) {
      vector<int> nx;
      while (par.size() >= 2) {
        int a = par.back();
        par.pop_back();
        int b = par.back();
        par.pop_back();
        if (query(a, b) == a) {
          nx.emplace_back(a);
          loser[a].emplace_back(b);
        } else {
          nx.emplace_back(b);
          loser[b].emplace_back(a);
        }
      }
      if (!par.empty()) nx.emplace_back(par[0]);
      par.swap(nx);
    }
    return par[0];
  };
  par = loser[get_winner()];
  int winner = get_winner();
  cout << "! " << winner + 1 << endl;
  return 0;
}