#include <algorithm>
// #include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
// using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

int main() {
    ll N;
    cin >> N;
    if (N == 1) {
        cout << "! 1 1" << endl;
    } else if (N == 2) {
        ll x1, x2, x3;
        cout << "? 1 1" << endl;
        cin >> x1;
        cout << "? 1 2" << endl;
        cin >> x2;
        cout << "? 2 1" << endl;
        cin >> x3;

        if (x1 == 1) {
            cout << "! 1 2 1 2" << endl;
        } else if (x2 == 1) {
            cout << "! 1 2 2 1" << endl;
        } else if (x3 == 1) {
            cout << "! 2 1 1 2" << endl;
        } else {
            cout << "! 2 1 2 1" << endl;
        }
    } else {
        ll prime;
        for (ll i = N / 2 + 1; i <= N; i++) {
            bool isprime = true;
            for (ll j = 2; j < i; j++) {
                if (i % j == 0) {
                    isprime = false;
                }
            }
            if (isprime) {
                prime = i;
            }
        }
        vector<ll> A(N);
        vector<ll> B(N);
        bool all_div = true;
        ll div_idx = -1;
        vector<ll> val1(N);
        for (ll i = 0; i < N; i++) {
            cout << "? 1 " << i + 1 << endl;
            cin >> val1[i];
            if (val1[i] % prime != 0) {
                all_div = false;
            } else {
                div_idx = i;
            }
        }
        if (all_div) {
            ll idx1 = -1;
            ll idx2 = -1;
            for (ll i = 0; i < N; i++) {
                if (val1[i] != prime) {
                    B[i] = val1[i] / prime;
                } else if (idx1 == -1) {
                    idx1 = i;
                } else {
                    idx2 = i;
                }
            }
            ll x1, x2;
            cout << "? 2 " << idx1 + 1 << endl;
            cin >> x1;
            cout << "? 2 " << idx2 + 1 << endl;
            cin >> x2;
            ll one_idx = -1;
            if (x1 % prime == 0) {
                B[idx1] = prime;
                B[idx2] = 1;
                one_idx = idx2;
            } else {
                B[idx1] = 1;
                B[idx2] = prime;
                one_idx = idx1;
            }
            for (ll i = 0; i < N; i++) {
                cout << "? " << i + 1 << " " << one_idx + 1 << endl;
                cin >> A[i];
            }
            cout << "!";
            for (ll i = 0; i < N; i++) {
                cout << " " << A[i];
            }
            for (ll i = 0; i < N; i++) {
                cout << " " << B[i];
            }
            cout << endl;
        } else {
            ll ax1 = -1;
            ll ax2 = -1;
            B[div_idx] = prime;
            vector<ll> val2(N);
            for (ll i = 0; i < N; i++) {
                cout << "? " << i + 1 << " " << div_idx + 1 << endl;
                cin >> val2[i];
                if (val2[i] != prime) {
                    A[i] = val2[i] / prime;
                } else if (ax1 == -1) {
                    ax1 = i;
                } else {
                    ax2 = i;
                }
            }
            ll val_ax1;
            cout << "? " << ax1 + 1 << " " << (div_idx + 1) % N + 1 << endl;
            cin >> val_ax1;
            if (val_ax1 % prime == 0) {
                A[ax2] = 1;
                A[ax1] = prime;
                for (ll i = 0; i < N; i++) {
                    if (i != div_idx) {
                        cout << "? " << ax2 + 1 << " " << i + 1 << endl;
                        cin >> B[i];
                    }
                }
            } else {
                A[ax1] = 1;
                A[ax2] = prime;
                for (ll i = 0; i < N; i++) {
                    if (i != div_idx) {
                        cout << "? " << ax1 + 1 << " " << i + 1 << endl;
                        cin >> B[i];
                    }
                }
            }
            cout << "!";
            for (ll i = 0; i < N; i++) {
                cout << " " << A[i];
            }
            for (ll i = 0; i < N; i++) {
                cout << " " << B[i];
            }
            cout << endl;
        }
    }
}