#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define debug(x) cout<<#x<<": "<<x<<endl
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
using ll=long long;
using ull=unsigned long long;
#define int long long
vector<vector<int>> a(2010,vector<int>(2010));
struct node
{
    int val,id;
    bool operator<(const node&t)const{
        if(id<t.id){
            return !(a[id][t.id]-a[id+1][t.id]-a[id][t.id-1]+a[id+1][t.id-1]);
        }
        else{
            return a[t.id][id]-a[t.id+1][id]-a[t.id][id-1]+a[t.id+1][id-1];
        }
    }
};
void solve(){
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            cout<<"? "<<i+1<<" "<<j+1<<endl;
            cout.flush();
            cin>>a[i][j];
        }
    }
    vector<node> res(n);
    for(int i=0;i<n;i++){
        res[i].val=i+1;
        res[i].id=i;
    }
    sort(res.begin(),res.end());
    cout<<"! ";
    cout.flush();
    for(int i=0;i<n;i++){
        cout<<res[i].val<<" ";
        cout.flush();
    }
    cout<<endl;
    cout.flush();
}
signed main(){
    ios::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
    int t=1;
    while(t--){
        solve();
    }
}