#include <cstdio>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <iostream>
#include <queue>
typedef long long LL;
using namespace std;
inline int read() {
    int num = 0 ,f = 1; char c = getchar();
    while (!isdigit(c)) f = c == '-' ? -1 : f ,c = getchar();
    while (isdigit(c)) num = (num << 1) + (num << 3) + (c ^ 48) ,c = getchar();
    return num * f;
}
const int N = 2005;
int res[N][N];
inline int ask(int l ,int r) {
    if (l >= r) return 0;
    if (res[l][r] != -1) return res[l][r];
    cout << "? " << l << ' ' << r << endl;
    int x = 0; cin >> x; return res[l][r] = x;
}
inline bool cmp(int i ,int j) {
    return ask(i ,j) ^ ask(i + 1 ,j) ^ ask(i ,j - 1) ^ ask(i + 1 ,j - 1);
}
int a[N] ,p[N] ,n;
signed main() {
    memset(res ,-1 ,sizeof(res));
    cin >> n;
    a[1] = 1;
    for (int i = 2; i <= n; i++) {
        int p = 0;
        if (cmp(a[1] ,i)) p = 0;
        else {
            int l = 1 ,r = i - 1;
            while (l < r) {
                int mid = (l + r + 1) >> 1;
                if (cmp(a[mid] ,i)) r = mid - 1;
                else l = mid;
            }
            p = l;
        }
        for (int j = i - 1; j > p; j--) a[j + 1] = a[j];
        a[p + 1] = i;
    }
    for (int i = 1; i <= n; i++) p[a[i]] = i;
    cout << "! ";
    for (int i = 1; i <= n; i++) cout << p[i] << ' ';
    cout << endl;
}