#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 123, MAXN = 2e5 + 47, MEGAINF = 1e18;
template <class T>
inline istream& operator>>(istream& in, vector<T>& a) {
  for (auto& i : a) in >> i;
  return in;
}
template <class T>
inline ostream& operator<<(ostream& out, vector<T>& a) {
  for (auto& i : a) out << i << " ";
  return out;
}
template <class T, class U>
inline istream& operator>>(istream& in, vector<pair<T, U>>& a) {
  for (auto& i : a) in >> i.first >> i.second;
  return in;
}
template <class T, class U>
inline ostream& operator<<(ostream& out, vector<pair<T, U>>& a) {
  for (auto& i : a) out << i.first << " " << i.second << endl;
  return out;
}
signed main() {
  setlocale(LC_ALL, "rus");
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n;
  vector<long long> z(11, -1);
  auto query = [&](long long i, long long j) {
    cout << "? " << i + 1 << " " << j + 1 << endl;
    long long ans;
    cin >> ans;
    return ans;
  };
  auto get = [&](long long i) {
    long long ans = ~0;
    for (long long b = 0; b < 11; ++b)
      if (z[b] != i)
        ans &= query(i, z[b]);
      else
        ans &= ~(1 << b);
    return ans;
  };
  while (count(z.begin(), z.end(), -1)) {
    long long i = rand() % n, j = rand() % n;
    if (i == j) continue;
    long long val = query(i, j);
    for (long long b = 0; b < 11; ++b)
      if (!(val >> b & 1)) z[b] = i;
  }
  long long i = 0, Pi = get(0);
  for (long long j = 1; j < n; ++j)
    if (query(i, j) == Pi) {
      i = j;
      Pi = get(j);
    }
  vector<long long> ans(n);
  ans[i] = 0;
  for (long long j = 0; j < n; ++j)
    if (i == j)
      continue;
    else
      ans[j] = query(i, j);
  cout << "! " << ans;
}
