#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
long long max(long long a, long long b) {
  if (a > b) {
    return a;
  } else {
    return b;
  }
}
long long min(long long a, long long b) {
  if (a < b) {
    return a;
  } else {
    return b;
  }
}
long long power(long long b, long long e) {
  if (e == 0) return 1;
  if (e % 2)
    return ((b * power((b) * (b), (e - 1) / 2)));
  else
    return power((b) * (b), e / 2);
}
long long modpower(long long b, long long e, long long q) {
  long long MOD = q;
  if (e == 0) return 1;
  if (e % 2)
    return ((b % MOD) * modpower((b % MOD) * (b % MOD), (e - 1) / 2, q)) % MOD;
  else
    return modpower((b % MOD) * (b % MOD), e / 2, q) % MOD;
}
void dpv(vector<long long> v) {
  for (long long i = 0; i < v.size(); i++) {
    cout << v[i] << " ";
  }
  cout << endl;
}
void dpv(vector<pair<long long, long long> > v) {
  for (long long i = 0; i < v.size(); i++) {
    cout << v[i].first << " " << v[i].second << endl;
  }
}
void dpv(set<long long> v) {
  for (auto i : v) {
    cout << i << " ";
  }
  cout << endl;
}
void oblivious() {
  long long n;
  cin >> n;
  if (n == 1) {
    cout << "! 1" << endl;
    fflush(stdout);
    return;
  } else {
    long long a[n];
    long long l = 0, r = n - 1;
    long long ans = 0;
    long long cnt = n * (n + 1) / 2;
    while (l < r) {
      long long x1, x2;
      cout << "? " << l + 1 << " " << r + 1 << endl;
      fflush(stdout);
      cin >> x1;
      cout << "? " << r + 1 << " " << l + 1 << endl;
      fflush(stdout);
      cin >> x2;
      if (x2 > x1) {
        a[r] = x2;
        ans += x2;
        r--;
      } else {
        a[l] = x1;
        ans += x1;
        l++;
      }
    }
    a[l] = cnt - ans;
    cout << "!";
    for (long long i = 0; i < n; i++) {
      cout << " " << a[i];
    }
    cout << endl;
    fflush(stdout);
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    oblivious();
  }
  return 0;
}
