#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

#define rep(i,n) for(ll i=0;i<n;++i)
#define all(a) (a).begin(),(a).end()
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }
template<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }
template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &a){
    if (a.empty()) return os;
    os << a.front();
    for (auto e : a | views::drop(1)){
        os << ' ' << e;
    }
    return os;
}

void dump(auto ...vs){
    ((cout << vs << ' '), ...) << endl;
}



void solve() {
    ll N;
    cin>>N;
    vector<ll> D(N,0);
    rep(i,N-1){
        cout<<"? "<<i<<' '<<N-1<<endl;
        ll res;
        cin>>res;
        D[i]=res;
    }
    ll z0=-1,z1=-1;
    rep(i,N-1){
        if (D[i]==0)continue;
        if (z0==-1){
            z0=i;
            continue;
        }
        if (z1==-1){
            z1=i;
            continue;
        }
    }
    if (z1==-1){
        if (z0==-1){
            cout<<"! -1"<<endl;
            return;
        }
        ll res=D[z0];
        if (res==1 or res==25 or res==49 or res==64 or res==81){
            ll s2=sqrtl(res);
            cout<<"! "<<s2;
            for (ll i=N-2;i>=0;i--){
                cout<<D[i]/s2;
            }
            cout<<endl;

        }
        else{
            cout<<"! -1"<<endl;
        }
        return;
    }
    ll res;
    cout<<"? "<<z0<<' '<<z1<<endl;
    cin>>res;
    ll r2=D[z0]*D[z1]/res;
    ll s2=sqrtl(r2);
    assert(s2*s2==r2);
    cout<<"! "<<s2;
    for (ll i=N-2;i>=0;i--){
        cout<<D[i]/s2;
    }
    cout<<endl;
    return;
}


int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll T=1;
    while (T--){
        solve();
    }
    return 0;
}