#include <bits/stdc++.h>
#include <string>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto &&e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S> bool chmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S> bool chmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

const int MIN_N=2,MAX_N=51;
int main(){
  int N;
  cin>>N;
  assert(N>=MIN_N&&N<=MAX_N);
  vi res(N+1);
  rep(i,N-1){
    cout<<std::format("? {} {}",N-1,i)<<endl;
    int x;
    cin>>x;
    res[i]=x;
  }
  bool f=0;
  int cnt=0;
  vector div(100,set<pii>());
  rep(i,10){
    rep(j,10){
      div[i*j].insert(pii{i,j});
    }
  }
  rep(i,N-1){
    if(res[i]!=0)cnt+=1;
  }
  if(cnt==0){
    cout<<"! -1"<<endl;
    return 0;
  }else if(cnt==1){
    rep(i,N-1){
      if(res[i]!=0){
        if(sz(div[res[i]])==1){
          string ans(N,'0');
          ans[N-1]=(*begin(div[res[i]])).first+48;
          ans[i]=(*begin(div[res[i]])).second+48;
          reverse(all(ans));
          cout<<"! "<<ans<<endl;
        }else{
          cout<<"! -1"<<endl;
        }
        return 0;
      }
    }
  }else{
    rep(i,N-1){
      rep(j,i+1,N-1){
        if(res[i]!=0&&res[j]!=0){
          cout<<std::format("? {} {}",i,j)<<endl;
          int x;
          cin>>x;
          int t=sqrt(res[i]*res[j]/x);
          string ans(N,'0');
          ans[N-1]=t+48;
          rep(k,N-1)ans[k]=res[k]/t+48;
          reverse(all(ans));
          cout<<"! "<<ans<<endl;
          return 0;
        }
      }
    }
  }

  

}