#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
    int n; cin>>n;
    vector<P> v(n*n-n);
    for(int i=1; i<n*n-n; i++){
        cout<<"? 1 "<<i+1<<endl;
        int p, q;
        cin>>p>>q;
        v[i]=P(p, q);
    }
    vector<P> vs=v;
    sort(vs.begin(), vs.end());
    int a0=-1, b0=-1;
    for(int i=1; i<n; i++){
        for(int j=0; j<n; j++){
            vector<P> w(n*n-n);
            int k=0;
            for(int a=1; a<n; a++){
                for(int b=0; b<n; b++){
                    int p=i-a, q=j-b;
                    if(p>q) swap(p, q);
                    w[k++]=P(p, q);
                }
            }
            sort(w.begin(), w.end());
            bool dame=0;
            for(int a=0; a<n*n-n; a++){
                if(w[a]!=vs[a]){
                    dame=1;break;
                }
            }
            if(!dame){
                assert(a0==-1);
                a0=i, b0=j;
            }
        }
    }
    assert(a0!=-1);
    auto check=[&](int x, int y){
        if(x<1 || x>=n || y<0 || y>=n) return false;
        return true;
    };
    int ans[3000];
    fill(ans, ans+n*n-n, -1);
    ans[0]=a0*n+b0;
    map<P, int> mp;
    for(int i=1; i<n*n-n; i++) mp[v[i]]=i;
    int imn=0, imx=0;
    for(int i=1; i<n*n-n; i++){
        if(v[i].first+v[i].second<v[imx].first+v[imx].second) imx=i;
        if(v[i].first+v[i].second>v[imn].first+v[imn].second) imn=i;
    }
    ans[imx]=n*n-1, ans[imn]=n;
    for(int i=1; i<n*n-n; i++){
        if(v[i].first==v[i].second){
            ans[i]=(a0-v[i].first)*n+(b0-v[i].second);
            continue;
        }
        if(ans[i]!=-1) continue;
        if(mp.find(P(v[i].second, v[i].first))==mp.end()){
            if(check(a0-v[i].first, b0-v[i].second)) ans[i]=(a0-v[i].first)*n+(b0-v[i].second);
            else ans[i]=(a0-v[i].second)*n+(b0-v[i].first);
            continue;
        }
        int j=mp[P(v[i].second, v[i].first)];
        int p1=a0-v[i].first-1, q1=b0-v[i].second, p2=a0-v[i].second-1, q2=b0-v[i].first;
        if(p1>q1) swap(p1, q1);
        if(p2>q2) swap(p2, q2);
        if(p1!=p2 || q1!=q2){
            cout<<"? "<<i+1<<" "<<imn+1<<endl;
            int p, q; cin>>p>>q;
            ans[i]=(a0-v[i].first)*n+(b0-v[i].second);
            ans[j]=(a0-v[i].second)*n+(b0-v[i].first);
            if(p==p2 && q==q2){
                swap(ans[i], ans[j]);
            }
        }else{
            p1=a0-v[i].first-(n-1), q1=b0-v[i].second-(n-1), p2=a0-v[i].second-(n-1), q2=b0-v[i].first-(n-1);
            assert(p1!=p2 || q1!=q2);
            cout<<"? "<<i+1<<" "<<imx+1<<endl;
            int p, q; cin>>p>>q;
            ans[i]=(a0-v[i].first)*n+(b0-v[i].second);
            ans[j]=(a0-v[i].second)*n+(b0-v[i].first);
            if(p==p2 && q==q2){
                swap(ans[i], ans[j]);
            }
        }
    }
    cout<<"!";
    for(int i=0; i<n*n-n; i++){
        cout<<" "<<ans[i];
    }
    cout<<endl;
    return 0;
}