#include <bits/stdc++.h>
#define int long long
using namespace std;
mt19937 rnd(time(0));
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int n;
    cin >> n;

    vector<int> a;
    a.push_back(1);

    vector vis(n + 1, vector<int> (n + 1, -1));
   	vector<int> f(n + 1);

    auto ask = [&](int l, int r) -> int {
    	if (l >= r) return 0;
    	if (vis[l][r] != -1) return vis[l][r];
    	cout << "? " << l << " " << r << endl;
    	int x;
    	cin >> x;
    	return vis[l][r] = x;
    };


    auto compare = [&](int x, int y) -> bool {
    	int a = ask(x, y - 1);
    	int b = ask(x + 1, y);
    	int c = ask(x, y);
    	int d = ask(x + 1, y - 1);
    	if ((a + b + c - d + 2) % 2 == 0) return false;
    	return true;
    };

    auto cp = [&](int x, int y) -> bool {
    	if ((f[x] + f[y]) & 1) {
    		return f[x] ? true : false;
    	}
    	int a = ask(x, y - 1);
    	int b = ask(x + 1, y);
    	int c = ask(x, y);
    	int d = ask(x + 1, y - 1);
    	if ((a + b + c - d + 2) % 2 == 0) return false;
    	return true;
    };

    int p = rnd() % n + 1;
    // cout << p << "\n";
    for (int i = 1; i <= n; i++) {
    	if (i == p) continue;
    	f[i] = compare(min(p, i), max(p, i)) ^ (i > p);
    }

    for (int i = 2; i <= n; i++) {
    	int L = 0, R = a.size() - 1, res = -1;
    	while (L <= R) {
    		int mid = (L + R) / 2;
    		if (!cp(a[mid], i)) {
    			res = mid;
    			L = mid + 1;
    		} else {
    			R = mid - 1;
    		}
    	}
    	a.insert(a.begin() + res + 1, i);
    }

    vector<int> ans(n + 1);
    for (int i = 0; i < n; i++) {
    	ans[a[i]] = i + 1;
    }

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

    return 0;
}