#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2010;
int n, a[N], res[N];

inline bool quest(int x, int y) 
{
    cout << "? " << x << " " << y << endl;
    bool t;
    cin >> t;
    return t;
}

bool check(int x, int n)
{
    if (x == 0) return true;
    bool st = quest(a[x], n) ^ quest(a[x] + 1, n);
    for (int i = 1; i < x; ++i)
        if (a[i] > a[x]) st ^= 1;
    return st;
}

int main(void)
{
    ios::sync_with_stdio(false); std::cin.tie(nullptr); std::cout.tie(nullptr);
    cin >> n;
    for (int i = 1; i <= n; ++i)
    {
        int l = 0, r = i - 1;
        while (l < r)
        {
            int mid = l + r + 1 >> 1;
            if (check(mid, i)) r = mid - 1;
            else l = mid;
        }
        for (int j = i; j > l + 1; --j) a[j] = a[j - 1];
        a[l + 1] = i;
    } 
    for (int i = 1; i <= n; ++i) res[a[i]] = i;

    cout << "!";
    for (int i = 1; i <= n; ++i) cout << ' ' << res[i];
    cout << endl;
    // cin >> n;
    return 0;
}