#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> ppi;
typedef pair<ll,ppi> pppi;
typedef pair<ll,pppi> ppppi;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
*/
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
vi fast_mod_convolution(vi&a,vi&b,ll mod){
  const ll m1=167772161,m2=469762049,m3=1224736769;
  const ll m1_inv_m2=inv_mod(m1,m2);
  const ll m12_inv_m3=inv_mod(m1*m2,m3);
  const ll m12_mod=m1*m2%mod;
  auto x=convolution<m1>(a,b);
  auto y=convolution<m2>(a,b);
  auto z=convolution<m3>(a,b);
  vector<ll>ret(sz(a)+sz(b)-1);
  REP(i,sz(ret)){
    ll v1=(y[i]-x[i])*m1_inv_m2%m2;if(v1<0)v1+=m2;
    ll v2=(z[i]-(x[i]+m1*v1)%m3)*m12_inv_m3%m3;if(v2<0)v2+=m3;
  	ret[i]=(x[i]+m1*v1+m12_mod*v2)%mod;
  }
  return ret;
}
const ld EPS=1e-8;
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}
//*/
const vi A={5,1,2,4,3,6,7,8,9,10};
const vi B={1,2,3,4,5,6,7,8,9,10};
ll query(ll i,ll j){
	cout<<"? "<<i+1<<" "<<j+1<<endl;
	ll res;cin>>res;
	//res=A[i]*B[j]/__gcd(A[i],B[j]);
	return res;
}
int main(){
  vector<bool>prime(2e6,1);
  prime[0]=prime[1]=0;
  REP(i,2e6)if(prime[i]){
  	ll j=2*i;
  	while(j<2e6){
  		prime[j]=0;j+=i;
  	}
  }
  ll N;cin>>N;
  if(N==1){cout<<"! 1 1"<<endl;return 0;}
  vi X(N);
  REP(i,N)X[i]=query(0,i);
  ll m=1e18;
  REP(i,N)chmin(m,X[i]);
  if(m==1){
  	vi B=X,A(N);
  	ll t=0;
  	while(B[t]!=1)t++;
  	REP(i,N)A[i]=query(i,t);
  	cout<<"! "<<A<<" "<<B<<endl;
  	return 0;
  }
  if(prime[m]&&2*m>N){
  	vi A(N);
  	REP(i,N)A[i]=X[i]/m;
  	vi C,Y(N);
  	REP(i,N)if(A[i]==1)C.emplace_back(i);
  	REP(i,N)Y[i]=query(i,C[0]);
  	auto Z=Y;
  	sort(ALL(Z));
  	bool ok=1;
  	REP(i,N)if(Z[i]!=i+1)ok=0;
  	ll one;
  	if(ok)A[C[1]]=m,one=C[0];
  	else A[C[0]]=m,one=C[1];
  	vi B(N);
  	REP(i,N)B[i]=query(i,one);
  	cout<<"! "<<B<<" "<<A<<endl;
  	return 0;
  }
  vi Y(N);
  REP(i,N)Y[i]=X[i]/m;
  sort(ALL(Y));
  ll p=0;
  REP(i,N)if(COU(Y,Y[i])==1&&prime[Y[i]])chmax(p,Y[i]);
  ll t=0;
  while(X[t]!=m*p)t++;
  vi Z(N);Z[0]=m*p;
  FOR(i,1,N)Z[i]=query(i,t);
  vi A(N);
  REP(i,N)A[i]=Z[i]/p;
  vi C;
  REP(i,N)if(A[i]==1)C.emplace_back(i);
  vi W(N);
  REP(i,N){
  	if(i==t)W[i]=p;
  	else W[i]=query(C[0],i);
  }
  vi B(N);
  bool one=1;
  REP(i,N){
  	if(i==t)B[i]=p;
  	else{B[i]=W[i];if(B[i]%p==0)B[i]/=p,one=0;}
  }
  if(one)A[C[1]]=p;
  else A[C[0]]=p;
  cout<<"! "<<A<<" "<<B<<endl;
  return 0;
}