#include<bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a;i <= b;i++)
#define pre(i, a, b) for(int i = a;i >= b;i--)
#define pb push_back
const int N=2e3+5;
int cnt=0;
map<pair<int,int>,int>m;
int ask(int l,int r){
	if(l>=r)return 0;
	
	if(m.count({l,r}))return m[{l,r}];
	cnt++;if(cnt>=40000)while(1);
	printf("? %d %d\n",l,r);//<<" "<<l<<" "<<r<<endl;
	fflush(stdout);
	int x;
	scanf("%d",&x); 
	m[{l,r}]=x;
	fflush(stdout);
	return x;
}
int get(int l,int r){//得到l和r的大小关系 
	int x=(ask(l,r)-ask(l+1,r)-ask(l,r-1)+ask(l+1,r-1)+4)%2;
//	cout<<l<<" @@"<<r<<" "<<x<<endl;
	return x;
}
int p[N];
void solve(int l,int r) {
	if(l==r){
		p[l]=l;
		return;
	}
    int mid=(l+r)/2;
    solve(1,mid);
    solve(mid+1,r);
    int x=mid,y=r;
    vector<int>w;
    //cout<<l<<" "<<r<<" "<<x<<" "<<y<<endl;
    pre(i,r,l){
    	if(x>=l&&y>mid)
    	{
    		//cout<<x<<" "<<y<<"!"<<endl;
    		if(get(p[x],p[y])){
    			w.pb(p[x]);
    			//cout<<p[x]<<"!"<<p[y]<<" "<<x<<"!!"<<endl;
    			x--;
			}
			else 
			{
				w.pb(p[y]);
				//cout<<p[x]<<"!"<<p[y]<<" "<<x<<"!!"<<endl;
				y--;
			}
		}
		else if(x>=l){
			w.pb(p[x]);
			x--;
		}
		else{
			w.pb(p[y]);
			y--;
		}
	}
	rep(i,0,w.size()-1){
		p[r-i]=w[i];
	}
	//rep(i,l,r)cout<<p[i]<<" "<<l<<" "<<r<<endl;
    
}

int q[2005];
int main() {

    int t = 1;
    //cin>> t ;


    while (t--) {
    	int n;
    	scanf("%d",&n);
    	solve(1,n);
    	printf("\n");
    	printf("! ");fflush(stdout);
        rep(i,1,n){
        	q[p[i]]=i;
        	//cout<<p[i]<<endl;
		}
		rep(i,1,n)printf("%d ",q[i]);
		printf("\n");
		fflush(stdout);
    }


    return 0;
}