#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rngl(chrono::steady_clock::now().time_since_epoch().count());
// #define int long long
// #define int unsigned long long
// #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>
// const ll mod = 1e9 + 7;
// const ll mod = 998244353;
const ll inf = 1e9;
const ll biginf = 1e18;
const int maxN = 1e6 + 15;
int ask(int i, int j) {
cout << "? " << i << ' ' << j << endl;
int ret; cin >> ret; return ret;
}
void solve() {
int n; cin >> n; int p[n + 1];
for (int i = 1; i <= n; i++) p[i] = i;
shuffle(p + 1, p + n + 1, rng);
int arr[n + 1];
int a = p[1], b = p[2], ab = ask(a, b);
for (int i = 3; i <= n; i++) {
int ap = ask(a, p[i]);
if (ap < ab) arr[p[i]] = ap;
else if (ap > ab) {
arr[b] = ab; ab = ap; b = p[i];
} else {
arr[a] = ap; a = p[i]; ab = ask(a, b);
}
}
arr[a] = arr[b] = ab;
cout << "! ";
for (int i = 1; i <= n; i++)
cout << arr[i] << ' ';
cout << endl;
}
int32_t main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
// ios_base::sync_with_stdio(false);
// cin.tie(nullptr); cout.tie(nullptr);
int t = 1;
// cin >> t;
while (t--) {
solve();
// cout << '\n';
}
return 0;
}
