#include<bits/stdc++.h>
using namespace std;
const int N = 2e3+7;
int p[N],rk[N];
int f[N][N];
bool get(int l,int r) {
    if(r <= l) return 0;
    if(~f[l][r]) return f[l][r];
    cout << "? " << l << " " << r << endl;
    int num;
    cin >> num;
    return f[l][r] = num;
}
struct BIT {
    int c[N];
    int lowbit(int x) {
        return x & -x;
    }
    void add(int x,int y) {
        while(x < N) {
            c[x] += y;
            x += lowbit(x);
        }
    }
    int Sum(int x) {
        int res = 0;
        while(x > 0) {
            res += c[x];
            x -= lowbit(x);
        }
        return res;
    }
}T;
bool get2(int l,int r) {
    if(r <= l) return 0;
    if(~f[l][r]) return f[l][r];
    int res = 0;
    for(int i=r;i>=l;--i) {
        res += T.Sum(rk[i]);
        T.add(rk[i], 1);
    }
    for(int i=r;i>=l;--i) {
        T.add(rk[i], -1);
    }
    return f[l][r] = res&1;
}
bool check(int ith,int y) {
    int x = p[ith];
    int a = get(x, y);
    int b = get(x+1, y);
    int c = get2(x, y-1);
    int d = get2(x+1, y-1);
    // if(x==3 && y==4) {
    //     printf("a=%d, b=%d, c=%d, d=%d\n",a, b, c, d);
    // }
    return (a^b^c^d)^1;   // 
}
void solve() {
    int n;
    cin >> n;
    p[1] = 1;
    for(int now=2;now<=n;++now) {
        int l = 1, r = now-1, res = 0;
        while(l <= r) {
            int mid = (l + r) >> 1;
            // if(mid == 1) {
            //     printf("mid=%d, p[mid]=%d\n",mid, p[mid]);
            // }
            if(check(mid, now)) {
                // printf("mid=%d, now=%d\n",mid, now);
                res = mid;
                l = mid + 1;
            } else {
                r = mid - 1;
            }
        }
        for(int i=now;i>res+1;--i) p[i] = p[i-1];
        p[res+1] = now;
        for(int i=1;i<=now;++i) rk[p[i]] = i;
        // printf("now = %d\n",now);
        // for(int i=1;i<=now;++i) printf("%d ",p[i]);
        // puts("");
    }

    vector<int> a(n+1, 0);
    for(int i=1;i<=n;++i) a[p[i]] = i;
    cout << "! ";
    for(int i=1;i<=n;++i) cout << a[i] << " ";
    cout << endl;
}
int main()
{
    memset(f, -1, sizeof(f));
    solve();
    return 0;
}