#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;

struct myHash {
    size_t operator()(pii p) const {
        return ((p.first * 1ll) << 32) + p.second;
    }
};
unordered_map<pii, int, myHash> mp;
int getV(int x, int y) {
    if(mp.count({x, y}))    return mp[{x, y}];
    int &ret = mp[{x, y}];
    printf("? %d %d\n", x, y);
    fflush(stdout);
    cin >> ret;
    return ret;
}

int main()
{
    ios::sync_with_stdio(false);
    int n;
    cin >> n;

    auto query = [](auto self, int x, int y) -> int {
        if(x > y)   return -self(self, y, x);
        if(x == 0)  return -1;
        int ret = 0;
        if(x + 1 == y) {
            ret ^= getV(x, y);
        } else {
            ret ^= getV(x + 1, y);
            ret ^= getV(x, y - 1);
            ret ^= getV(x, y);
            if(x + 1 != y - 1)  ret ^= getV(x, y);
        }
        ret = (ret? 1: -1);
        return ret;
    };
    vector<int> pos;
    pos.push_back(0);

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

        pos.insert(pos.begin() + ans + 1, i);
    }

    vector<int> out(n + 1);
    for(int i = 1; i <= n; i++) out[pos[i]] = i;
    printf("! ");
    for(int i = 1; i <= n; i++) printf("%d%c", out[i], i == n? '\n': ' ');
    fflush(stdout);

    return 0;
}