#include <bits/stdc++.h>
 
#define ll long long
#define lb lower_bound
#define pii pair<int,int>
#define pll pair<ll,ll>
#define F first
#define S second
#define ld long double
#define pb push_back
#define all(v) v.begin(),v.end()
#define in insert
#define sz(s) (int)s.size()
#define ppb pop_back
#define mem(a,i) memset(a,i,sizeof(a))
#define int ll

using namespace std;
 
const int MAX=30000+10;
const int inf=2e18;
const int mod=1e9+7;

const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n;

int ask(int i,int j){
    cout<<"? "<<i<<" "<<j<<endl;
    int x;
    cin>>x;
    return x;
}

int ans[MAX];

void solve(){
    cin>>n;
    vector<int> v;
    for(int i=1;i<=n;i++)v.pb(i);
    shuffle(all(v),rng);
    int m1=v[0],m2=v[1],mn=ask(m1,m2);
    for(int i=2;i<n;i++){
        int x=ask(m1,v[i]);
        if(x<mn){
            ans[v[i]]=x;
        }
        else if(x==mn){
            ans[m1]=mn;
            m1=v[i];
            mn=ask(m1,m2);
        }
        else{
            ans[m2]=mn;
            m2=v[i];
            mn=x;
        }
    }
    ans[m1]=ans[m2]=mn;
    cout<<"! ";
    for(int i=1;i<=n;i++)cout<<ans[i]<<" ";
    cout<<endl;
}

signed main(){
    // freopen("escape.in","r",stdin);
    // freopen("escape.out","w",stdout);
    ios_base::sync_with_stdio(0);
    // cin.tie(0);
    // cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--)solve();
}