//qoj6303
#include <bits/stdc++.h>
using namespace std; typedef long long ll;
void solve();int main(){ solve(); return 0; }

const int N = 2010;
int n, nx[N], ps[N], a[N], nw;

int ask(int l, int r){
	if(l >= r){
		return 0;
	}
	if(r <= nw - 1){
		return nx[l];
	}
	printf("? %d %d\n", l, r);
	fflush(stdout);
	int x;
	scanf("%d", &x);
	return x;
}
bool chk(int l, int r){
	return ask(l, r) - ask(l+1, r) - ask(l, r-1) + ask(l+1, r-1);
}

void solve(){
	scanf("%d", &n);
	ps[1] = a[1] = 1;
	for(int i = 2; i <= n; ++ i){
		nw = i;
		if(!chk(ps[i-1], i)){
			a[i] = ps[i] = i;
		} else {
			int l = 1, r = i - 1;
			while(l < r){
				int mid = l + r >> 1;
				if(chk(ps[mid], i)){
					r = mid;
				} else {
					l = mid + 1;
				}
			}
			a[i] = l;
			for(int j = 1; j < i; ++ j){
				if(a[j] >= l){
					++ a[j];
				}
				ps[a[j]] = j;
			}
			ps[a[i]] = i;
		}
		int vl = i - a[i];
		for(int j = 1; j < i; ++ j){
			nx[j] = (nx[j] + vl) % 2;
			if(a[j] > a[i]){
				-- vl;
			}
		}
	}
	printf("! ");
	for(int i = 1; i <= n; ++ i){
		printf("%d ", a[i]);
	}
	fflush(stdout);
}