#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i <= (b); ++i)
#define drep(i,a,b) for (int i = (a); i >= (b); --i)
#define LL long long
#define pii pair<int,int>
#define pll pair<LL,LL>
#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define all(v) v.begin(),v.end()
#define sz(v) ((int)v.size())
using namespace std;
LL read() {
	LL x = 0,y = 1; char ch = getchar(); while (!isdigit(ch)) {if (ch == '-') y = -y; ch = getchar();}
	while (isdigit(ch)) {x = x*10+ch-'0'; ch = getchar();} return x*y;
}
const int tst = 0,rd = 0; int getflg = 0;
namespace qiqi {
	mt19937 rnd(random_device{}());
	const int N = 2005,NUM = 20; int n,cnt,a[N],p[N],vis[N][N],val[N][N],ans[N],aval[N][N];
	int getrnd(int l,int r) {
		int k = r-l+1;
		return ((rnd()%k+k)%k)+l;
	}
	int qry(int l,int r) {
		if (vis[l][r]) return val[l][r];
		vis[l][r] = 1; ++cnt;
		if (!tst) {
			printf("? %d %d\n",l,r);
			fflush(stdout);
			return val[l][r] = read();
		}
		else {
			return val[l][r] = aval[l][r];
		}
	}
	bool cmp(int x,int y) {
		if (x+1 == y) return qry(x,y)^1;
		return qry(x,y)^qry(x+1,y)^qry(x,y-1)^qry(x+1,y-1)^1;
	}
	void main() {
		cnt = 0; rep(i,1,n) rep(j,1,n) vis[i][j] = 0;
		if (!tst) {
			n = read();
		}
		else {
			if (rd) {
				n = read();
				rep(i,1,n) ans[i] = read();
			}
			else {
				n = getrnd(1,NUM);
				iota(ans+1,ans+n+1,1);
				shuffle(ans+1,ans+n+1,rnd);
			}
			rep(i,1,n) {
				drep(j,i-1,1) {
					aval[j][i] = aval[j+1][i]^(ans[j]>ans[i]);
				}
				rep(j,1,i) aval[j][i] ^= aval[j][i-1];
			}
		}
		rep(i,1,n) {
			int l = 1,r = i;
			while (l != r) {
				int mid = l+((r-l)>>1);
				cmp(a[mid],i) ? l = mid+1 : r = mid;
			}
			drep(j,i,l+1) a[j] = a[j-1];
			a[l] = i; rep(j,1,i) p[a[j]] = j;
			drep(j,i-1,1) {
				val[j][i] = val[j+1][i]^(p[j]>p[i]);
			}
			rep(j,1,i) {
				vis[j][i] = 1; val[j][i] = val[j][i-1]^val[j][i];
			}
			if (tst && rd) {
				printf("%d %d\n",i,l);
				rep(j,1,i) printf("%d ",a[j]); puts("");
				rep(j,1,i) printf("%d ",p[j]); puts("");
			}
		}
		if (!tst) {
			putchar('!'); rep(i,1,n) printf(" %d",p[i]); puts("");
			fflush(stdout);
		}
		else {
			int flg = 1; rep(i,1,n) flg &= p[i] == ans[i];
			if (!flg || cnt > 40000) {
				if (!flg) {
					puts("Wrong Output");
					rep(i,1,n) printf("%d ",p[i]); puts("");
				}
				else {
					puts("Queries Too Many");
				}
				if (!rd) {
					printf("\n%d\n",n);
					rep(i,1,n) printf("%d ",ans[i]); puts("");
					getflg = 1;
				}
			}
		}
	}
}
int main() {
	if (!tst || rd) qiqi::main();
	else {
		rep(i,1,100) {
			qiqi::main();
			if (getflg) break;
		}
		puts("OK");
	}
	return 0;
}