#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000
vector<int> a;
int N;
pair<int,int> calc(int a,int b){
	int x = a/N - b/N;
	int y = a%N - b%N;
	if(x>y)swap(x,y);
	
	return make_pair(x,y);
}

pair<int,int> query(int i,int j){
	cout<<"? "<<i<<' '<<j<<endl;
	
	//cout<<calc(a[i-1],a[j-1]).first<<' '<<calc(a[i-1],a[j-1]).second<<endl;
	//return calc(a[i-1],a[j-1]);
	
	int r0,r1;
	cin>>r0>>r1;
	
	return make_pair(r0,r1);
}



void answer(vector<int> ans){
	cout<<"!";
	rep(i,ans.size()){
		cout<<' '<<ans[i];
	}
	cout<<endl;
}

void solve(){
	vector<int> ans(N*N-N,-1);
	vector<pair<int,int>> ret;
	rep(i,ans.size()){
		if(i==0)continue;
		ret.push_back(query(1,i+1));
	}
	
	{
		vector<pair<int,int>> temp = ret;
		sort(temp.begin(),temp.end());
		rep(i,N*N-N){
			vector<pair<int,int>> X;
			rep(j,N*N-N){
				if(i==j)continue;
				X.push_back(calc(i+N,j+N));
			}
			sort(X.begin(),X.end());
			if(X==temp){
				ans[0] = i+N;
				break;
			}
		}
	}
		
	map<int,vector<int>> mp;
	rep(i,ret.size()){
		rep(j,N*N-N){
			if(ret[i]==calc(ans[0],j+N)){
				mp[j+N].push_back(i+1);
				break;
			}
		}		
	}

	while(mp.size()!=0){

		for(auto it = mp.begin();it!=mp.end();){
			if(it->second.size()==1){
				ans[it->second[0]] = it->first;
				it = mp.erase(it);
			}
			else{
				int x = it->first;
				int y;
				for(int i=x+1;i<N*N;i++){
					if(calc(ans[0],x)==calc(ans[0],i)){
						y = i;
						break;
					}
				}

				bool f = false;
				rep(i,ans.size()){
					if(ans[i]==-1)continue;
					if(calc(ans[i],x)!=calc(ans[i],y)){
						pair<int,int> ret = query(i+1,it->second[0]+1);
						if(ret==calc(ans[i],x)){
							ans[it->second[0]] = x;
							ans[it->second[1]] = y;
						}
						else{
							ans[it->second[0]] = y;
							ans[it->second[1]] = x;
						}
						f=true;
						break;
					}
				}
				if(f){
					it = mp.erase(it);
				}
				else{
					it++;
				}
			}
		}
	}
	
	answer(ans);
	
}

int main(){
	
	cin>>N;
	/*
	a.resize(N*N-N);
	rep(i,N*N-N){
		cin>>a[i];
	}
	*/
	
	solve();		
	
	return 0;
}