#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


#include <chrono>
#ifdef LOCAL
mt19937_64 rng(58);
#else
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#endif


int N;

int ask(int i, int j) {
  assert(1 <= i); assert(i <= N);
  assert(1 <= j); assert(j <= N);
  assert(i != j);
  printf("? %d %d\n", i, j);
  fflush(stdout);
  int ret;
  scanf("%d", &ret);
  return ret;
}

int main() {
  scanf("%d", &N);
  
  vector<int> is(N + 1);
  for (int i = 1; i <= N; ++i) is[i] = i;
  for (int h = 1; h <= N; ++h) swap(is[1 + rng() % h], is[h]);
  
  vector<int> ans(N + 1);
  {
    int i = is[1], j = is[2];
    int a = ask(i, j);
    for (int h = 3; h <= N; ++h) {
      int k = is[h];
      int b = ask(i, k);
      if (a == b) {
        ans[i] = a;
        a = ask(i = k, j);
      } else {
        if (a > b) {
          swap(j, k);
          swap(a, b);
        }
        ans[j] = a;
        j = k;
        a = b;
      }
    }
    ans[i] = ans[j] = a;
  }
  
  printf("!");
  for (int i = 1; i <= N; ++i) {
    printf(" %d", ans[i]);
  }
  puts("");
  fflush(stdout);
  return 0;
}