#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------


int N;
int A[5050];

map<pair<int,int>,pair<int,int>> memo;

pair<int,int> ask(int x,int y) {
	
	if(memo.count({x,y})) return memo[{x,y}];
	
	cout<<"? "<<(x+1)<<" "<<(y+1)<<endl;
	int a,b;
	cin>>a>>b;
	return memo[{x,y}]={a,b};
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	MINUS(A);
	
	cin>>N;
	deque<int> cand;
	FOR(i,N*N-N) cand.push_back(i);
	
	while(cand.size()>1) {
		x=cand.front();
		cand.pop_front();
		y=cand.front();
		cand.pop_front();
		if(x>y) swap(x,y);
		
		auto p=ask(x,y);
		
		if(p.first>=0&&p.second>=0) {
			cand.push_back(x);
		}
		else {
			cand.push_back(y);
		}
	}
	x=cand.front();
	A[x]=N*N-1;
	FOR(i,N*N) {
		FORR(m,memo) {
			x=m.first.first;
			y=m.first.second;
			
			if(A[x]>=0&&A[y]==-1) {
				int a=A[x]/N-m.second.first;
				int b=A[x]%N-m.second.second;
				A[y]=a*N+b;
			}
			if(A[y]>=0&&A[x]==-1) {
				int a=A[y]/N+m.second.first;
				int b=A[y]%N+m.second.second;
				A[x]=a*N+b;
			}
		}
	}
	
	cout<<"!";
	FOR(i,N*N-N) cout<<" "<<A[i];
	cout<<endl;
	
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}