#include <iostream>
#include <algorithm>

using namespace std;

using ll = long long;

constexpr int L = 55;
constexpr ll B = 1e16;
constexpr int LGN = 9;

struct BI {
    ll a[L];

    BI(int x = 0) {
        fill(a, a + L, 0);
        a[0] = x;
    }
};

BI& operator*=(BI &a, int b) {
    ll c = 0;
    for (int i = 0; i < L; i++) {
        ll t = 1ll * a.a[i] * b + c;
        a.a[i] = t % B;
        c = t / B;
    }
    return a;
}

BI operator-(const BI &a, const BI &b) {
    BI c = 0;
    for (int i = 0; i < L; i++) {
        c.a[i] = a.a[i] - b.a[i];
    }
    for (int i = 0; i < L - 1; i++) {
        if (c.a[i] < 0) {
            c.a[i+1]--;
            c.a[i] += B;
        }
    }
    return c;
}

BI operator+(const BI &a, const BI &b) {
    BI c = 0;
    for (int i = 0; i < L; i++) {
        c.a[i] = a.a[i] + b.a[i];
    }
    for (int i = 0; i < L - 1; i++) {
        if (c.a[i] >= B) {
            c.a[i+1]++;
            c.a[i] -= B;
        }
    }
    return c;
}

BI& operator/=(BI &a, int b) {
    ll q = 0;
    for (int i = L - 1; i >= 0; i--) {
        q = q * B + a.a[i];
        a.a[i] = q / b;
        q %= b;
    }
    return a;
}

int divmod(BI &a, int b) {
    ll q = 0;
    for (int i = L - 1; i >= 0; i--) {
        q = q * B + a.a[i];
        a.a[i] = q / b;
        q %= b;
    }
    return q;    
}

bool operator>(const BI &a, const BI &b) {
    for (int i = L - 1; i >= 0; i--) {
        if (a.a[i] != b.a[i]) {
            return a.a[i] > b.a[i];
        }
    }
    return false;
}

void add(int bit[], int n, int x, int a) {
    for (; x <= n; x += x & -x) {
        bit[x] += a;
    }
}

int qry(int bit[], int n, int v) {
    int x = 0, cur = 0;
    for (int i = LGN - 1; i >= 0; i--) {
        if (x + (1 << i) <= n) {
            if (cur + bit[x+(1<<i)] <= v) {
                cur += bit[x+(1<<i)];
                x += 1 << i;
            }
        }
    }
    return x + 1;
}

void find_perm(BI a, int n, int p[]) {
    for (int i = 0; i < n; i++) {
        p[i] = divmod(a, i + 1);
    }

    int bit[n+1];
    fill(bit, bit + n + 1, 0);
    for (int i = 1; i <= n; i++) {
        add(bit, n, i, 1);
    }

    for (int i = n - 1; i >= 0; i--) {
        p[i] = qry(bit, n, p[i]);
        add(bit, n, p[i], -1);
    }

    reverse(p, p + n);
}

int main() {
    int n;
    cin >> n;

    BI l = 0, r = 1;
    for (int i = 1; i <= n; i++) {
        r *= i;
    }
    r = r - 1;

    BI one = 1;
    while (r - l > one) {
        BI mid = l + r;
        mid /= 2;

        int q[n];
        find_perm(mid, n, q);

        cout << "?";
        for (int i = 0; i < n; i++) {
            cout << " " << q[i];
        }
        cout << endl;

        int res;
        cin >> res;

        if (res == 1) {
            l = mid;
        } else {
            r = mid;
        }
    }

    int ans[n];
    find_perm(l, n, ans);

    cout << "!";
    for (int i = 0; i < n; i++) {
        cout << " " << ans[i];
    }
    cout << endl;

    return 0;
}