#include <bits/stdc++.h>
using namespace std;
const int N = 2001;
int cnt[N][N];

int query(int x, int y) {
    if(cnt[x][y] != -1) return cnt[x][y];
    printf("? %d %d\n", x, y);
    fflush(stdout);
    cin >> cnt[x][y];
    return cnt[x][y];
}

int cmp(int x, int y) {
    if(x > y)   return -cmp(y, x);
    if(x == 0)  return 0;
    int tmp = query(x, y) ^ query(x + 1, y) ^ query(x, y - 1) ^ query(x + 1, y - 1);
    return tmp? 1: -1;
}

int main()
{
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    for(int i = 0; i <= n; i++) {
        for(int j = 0; j <= n; j++) cnt[i][j] = (i < j)? -1: 0;
    }

    vector<int> pos;
    for(int i = 1; i <= n; i++) {
        int lh = 0, rh = pos.size() - 1, ans = pos.size();
        while(lh <= rh) {
            int mid = (lh + rh) / 2;
            if(cmp(pos[mid], i) > 0) {
                ans = mid;
                rh = mid - 1;
            } else {
                lh = mid + 1;
            }
        }
        pos.insert(pos.begin() + ans, i);

        vector<int> p(i + 1);
        for(int j = 0; j < i; j++)     p[pos[j]] = j + 1;
        for(int j = i - 1; j >= 1; j--)  if(cnt[j][i] == -1) {
            cnt[j][i] = cnt[j+1][i] ^ cnt[j][i-1] ^ cnt[j+1][i-1] ^ (p[j] > p[i]);
        }
    }

    vector<int> ans(n + 1);
    for(int j = 0; j < n; j++) ans[pos[j]] = j + 1;
    printf("!");
    for(int j = 1; j <= n; j++) printf(" %d", ans[j]);
    printf("\n");
    fflush(stdout);

    return 0;
}