#include <bits/stdc++.h>

using namespace std;

const int N = 2E3 + 5;

int rec[N][N];
int p[N];
int g[N];
int ans[N];
int n;

int query(int x, int y) {
    if (x == y) {
        return 0;
    }
    if (rec[x][y] != -1) {
        return rec[x][y];
    }
    printf("? %d %d\n", x, y);
    fflush(stdout);
    
    int ret;
    scanf("%d", &ret);
    return ret;
}

int check(int l, int r) {
    int a = query(l, r), b = query(l + 1, r);
    return ((a - b - g[l] + g[l + 1]) % 2 + 2) % 2;
}

int main() {
    memset(rec, -1, sizeof rec);
    scanf("%d", &n);
    
    p[1] = 1, g[1] = 0;
    for (int i = 2; i <= n; i++) {
        int l = 1, r = i - 1, ret = i;
        while (l <= r) {
            int mid = (l + r) / 2;
            if (check(mid, i)) { // p[mid] > p[i]
                r = mid - 1;
                ret = mid;
            } else {
                l = mid + 1;
            }
        }
        
        int sum = 0;
        int suf = 0;
        for (int j = i; j > ret; j--) {
            p[j] = p[j - 1];
            g[j] = g[j - 1];
            sum ^= 1;
            suf ^= g[j];
        }
        p[ret] = i, g[ret] = (suf ^ sum);
        for (int j = 1; j < ret; j++) {
            g[j] ^= sum;
        }
    }
    
    for (int i = 1; i <= n; i++) {
        ans[p[i]] = i;
    }
    printf("!");
    for (int i = 1; i <= n; i++) {
        printf(" %d", ans[i]);
    }
    fflush(stdout);
    return 0;
}