#include <bits/stdc++.h>

using namespace std;
using ll = long long;

namespace SA { // SuffixAutomaton
    constexpr int A = 26;
    struct Node {
        int par = 0, suf = 0;
        int depth = 0;
        array<int, A> nxt{};

        Node() = default;
        Node(int a, int b) : par(a), suf(b) {}
    };

    // vertex #0 is a dummy vertex, root is #1
    vector<Node> t;
    int P = 1;

    void init() {
        t = {{}, {}};
        P = 1;
    }

    int add(int a, int ch) {
        int b = size(t);
        t.emplace_back(a, 1);
        t[b].depth = t[a].depth + 1;
        for (; a != 0; a = t[a].suf) {
            if (t[a].nxt[ch] == 0) {
                t[a].nxt[ch] = b;
                continue;
            }
            int c = t[a].nxt[ch];
            if (t[c].par == a) {
                t[b].suf = c;
            } else {
                int d = size(t);
                t.emplace_back(a, t[c].suf);
                t[d].depth = t[a].depth + 1;
                t[d].nxt = t[c].nxt;
                t[c].suf = t[b].suf = d;
                for (; a != 0 && t[a].nxt[ch] == c; a = t[a].suf) {
                    t[a].nxt[ch] = d;
                }
            }
            break;
        }
        return P = t[t[b].par].nxt[ch];
    }

    long long get_diff_strings() {
        long long tot = 0;
        for (int i = 2; i < t.size(); i++) {
            tot += t[i].depth - t[t[i].suf].depth;
        }
        return tot;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

#ifdef LOCAL
    vector<int> arr(n);
    for (int &x : arr) {
        cin >> x;
    }
#endif

    auto ask = [&](int l, int r) {
#ifdef LOCAL
        vector<int> u(arr.begin() + l - 1, arr.begin() + r);
        SA::init();
        for (int x : u) {
            SA::add(SA::P, x);
        }
        cout << "u: ";
        for (int x : u) {
            cout << x << " ";
        }
        cout << endl;
        cout << "result: " << SA::get_diff_strings() << endl;
        return SA::get_diff_strings();
//        return unique(u.begin(), u.end()) - u.begin();
#else
        cout << "? " << l << " " << r << endl;
        int res;
        cin >> res;
        return res;
#endif
    };

    vector<int> a(n + 1);
    auto stupid = [&](int l, int r) -> int {
        int x = 0;
        vector<int> b(r - l + 1);
        for (int i = 0; i <= r - l; ++i) {
            b[i] = (a[i + l] < l ? ++x : b[a[i + l] - l]);
        }
        SA::init();
        for (int x : b) {
            SA::add(SA::P, x);
        }
        return SA::get_diff_strings();
    };

    int x = 0;
    vector<int> ans(n + 1);
    for (int i = 2; i <= n; ++i) {
        int lo = 0, hi = i;
        while (lo + 1 < hi) {
            int mid = lo + hi >> 1;
            if (ask(mid, i) == stupid(mid, i - 1) + i - mid + 1) {
                hi = mid;
            } else {
                lo = mid;
            }
        }
        a[i] = lo;
    }
    for (int i = 1; i <= n; ++i) {
        if (a[i] == 0) {
            ans[i] = ++x;
        } else {
            ans[i] = ans[a[i]];
        }
    }

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

    return 0;
}