#include <bits/stdc++.h> 
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
 #define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)

ll INF=2e18;


int main() {
    ios::sync_with_stdio(false);
  cin.tie(0);
  
  ll N;cin>>N;
  if(N==1) {
    cout<<"! "<<1<<" "<<1<<endl;
    return 0;
  }

  vector<bool> note(N+1);
  
  for(ll i=2;i<=N;i++) {
    if(note[i]) continue;
    for(ll j=2;j*i<=N;j++) note[j*i]=true;
  }


vector<ll> A(N),B(N);

vector<ll> C(N);
for(ll i=0;i<N;i++) {
  cout<<"? "<<1<<" "<<i+1<<endl;
  ll X;cin>>X;
  C[i]=X;
}

//ok

ll mi=INF;
for(ll i=0;i<N;i++) mi=min(mi,C[i]);
A[0]=mi;
ll ma=0,ind=0;

for(ll i=0;i<N;i++) {
  ll k=C[i]/A[0];
  if(!note[k]&&ma<k) {
    ma=k;
    ind=i;
  }
}

B[ind]=ma;//1もありうる

vector<ll> D(N);
for(ll i=1;i<N;i++) {
  cout<<"? "<<i+1<<" "<<ind+1<<endl;
  ll X;cin>>X;
  D[i]=X;
}

for(ll i=1;i<N;i++) {
  A[i]=D[i]/ma;
}

vector<ll> v(0);
for(ll i=0;i<N;i++) {
  if(A[i]==2) v.push_back(i);
}

//maが1出ないかつma*2<=Nのとき
if(v.size()==2) {
  ll to;
  for(ll i=0;i<N;i++) {
    if(C[i]==A[0]) to=i;
  }

  cout<<v[0]+1<<" "<<to+1<<endl;
  ll X;cin>>X;
  if(X%ma==0) {
    A[v[0]]=ma*2;
    A[v[1]]=2;
  }
  else {
    A[v[0]]=2;
    A[v[1]]=ma*2;
  }
}


//maが１出ない場合
vector<ll> vec(0);
for(ll i=0;i<N;i++) {
if(A[i]==1) vec.push_back(i);
}

if(vec.size()==2) {
ll to=0;
for(ll i=0;i<N;i++) {
  if(C[i]==A[0]) to=i;
}

cout<<"? "<<vec[0]+1<<" "<<to+1<<endl;
ll X;cin>>X;
if(X%ma==0) {
  A[vec[0]]=ma;
  A[vec[1]]=1;
}
else {
  A[vec[0]]=1;
  A[vec[1]]=ma;
}
}


ll one;
for(ll i=0;i<N;i++) {
  if(A[i]==1) one=i;
}

for(ll i=0;i<N;i++) {
  if(i==ind) continue;
  cout<<"? "<<one+1<<" "<<i+1<<endl;
  ll X;cin>>X;
  B[i]=X;
}


cout<<"! ";
for(auto x:A) cout<<x<<" ";
for(auto x:B) cout<<x<<" ";
cout<<endl;
}