#include<bits/stdc++.h>

#define fi first
#define se second
#define vc vector
#define db double
#define END exit(0)
#define pb push_back
#define mk make_pair
#define ll long long
#define PI pair<int,int>
#define ull unsigned long long
#define all(x) x.begin(), x.end()
#define err cerr << " -_- " << endl
#define debug(...) fprintf(stderr, __VA_ARGS__)

#define input(x) freopen(#x".in","r",stdin)
#define output(x) freopen(#x".out","w",stdout)

//useful:
//#define cout cerr
//#define OccDreamer
//#define int long long

using namespace std;

namespace IO{
	inline int read(){
		int X=0, W=0;char ch=getchar();
		while(!isdigit(ch)) W|=ch=='-', ch=getchar();
		while(isdigit(ch)) X=(X<<1)+(X<<3)+(ch^48), ch=getchar();
		return W?-X:X;
	}
	inline void write(ll x){
		if(x<0) x=-x, putchar('-');
		if(x>9) write(x/10);
		putchar(x%10+'0');
	}
	inline void sprint(ll x){write(x);putchar(32);}
	inline void eprint(ll x){write(x);putchar(10);}
}using namespace IO;

const int inf=1e9;
const int MAXN=4e5+5;
const int mod=998244353;

int n;
int a[MAXN], tree[MAXN], pos[MAXN];

inline int lowbit(int x){return x&-x;}

inline void add(int x){while(x) tree[x]++, x^=lowbit(x); return ;}

inline int ask(int x){int s=0; while(x<=n) s+=tree[x], x+=lowbit(x); return s;}

inline int ask(int l, int r){
	if(l>r) return 0;
	cout << "? " << l << ' ' << r << endl;
	int res; cin >> res; return res;
}

inline int Ask(int l, int r){
	int res=0;
	for(int i=1;i<=n;++i) tree[i]=0;
	for(int i=l;i<=r;++i) res+=ask(a[i]), add(a[i]);
	return res%2;
}

inline int query(int a, int b){
	int A=ask(a,b), B=ask(a+1,b);
	int C=Ask(a,b-1), D=Ask(a+1,b-1);
	return (A-C-B+D+5)%2;
}

int main(){
	cin >> n; a[1]=pos[1]=1;
	for(int i=2;i<=n;++i){
		int l=1, r=i-1, mid;
		while(l<=r){
			mid=(l+r)>>1;
			if(query(pos[mid],i)) l=mid+1;
			else r=mid-1;
		}
		for(int j=r+1;j<i;++j) a[pos[j]]++; a[i]=r+1;
		for(int j=1;j<=i;++j) pos[a[j]]=j;
	}
	cout << "! ";
	for(int i=1;i<=n;++i) cout << a[i] << ' ';
	cout << endl;
	return 0;
}