#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}


//a以下の素数を列挙、計算量:Nlog(log(N))
vector<long long> Eratosthenes(long long a){
    if(a<2) return {};
    vector<long long> p(a+1),ans;
    p[0]=1,p[1]=1;
    long long k=2;
    while(k*k<=a){
        if(p[k]==0){
            ans.push_back(k);
            for(long long i=2;i*k<=a;i++){
                p[i*k]=1;
            }
        }
        k++;
    }
    while(k<=a){
        if(p[k]==0) ans.push_back(k);
        k++;
    }
    return ans;
}

void solve();
// oddloop
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t=1;
    //cin>>t;
    rep(i,0,t) solve();
}

void solve(){
    int N;
    cin>>N;
    if(N==1){
        cout<<"! 1 1"<<endl;
        return;
    }
    int X=(*(Eratosthenes(N)).rbegin());
    vector<vector<int>> A(2,vector<int>(N));
    auto f=[&](int a,int b) -> int {
        cout<<"? "<<a+1<<" "<<b+1<<endl;
        int res;
        cin>>res;
        return res;
    };
    int s=-1,t=-1;
    bool ok=0;
    rep(i,0,N){
        if(i==N-1||f(i,i)%X==0){
            if(ok||i==N-1||f(i,(i+1%N))%X==0){
                s=i;
                break;
            }
            ok=1;
        }
    }
    int po=0;
    rep(i,0,N){
        int val=f(s,i);
        if(val==X){
            if(po) A[1][i]=po;
            else{
                if(f((s+1)%N,i)%X){
                    A[1][i]=1;
                    po=X;
                }
                else{
                    A[1][i]=X;
                    po=1;
                }
            }
        }
        else{
            A[1][i]=val/X;
        }
        if(A[1][i]==1) t=i;
    }
    rep(i,0,N){
        if(i==s) A[0][s]=X;
        else A[0][i]=f(i,t);
    }
    cout<<"!";
    rep(i,0,2) rep(j,0,N) cout<<" "<<A[i][j];
    cout<<endl;
}
/*
? 1 1
3
? 1 2
1
? 2 2
2
? 3 3
6
? 3 1
3
? 1 1
3
? 3 2
3
? 3 3
6

? 1 2
1
? 2 2
2
! 1 2 3 3 1 2
*/