#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<int>ans(n, 0);
	vector<int>pos;
	rep2(i, 1, n) {
		// 0->n-1 i->n-1-i
		cout << "? " << n - 1 - i << " " << n - 1 - 0 << endl;
		cin >> ans[i];
		if (ans[i] != 0)pos.push_back(i);
		if (ans[i] == -1) return -1;
	}
	if (pos.size() <= 1) {
		cout << "! " << -1 << endl;
		return 0;
	}
	cout << "? " << n - 1 - pos[1] << " " << n - 1 - pos[0] << endl;
	int x; cin >> x;
	if (x == -1) return -1;
	ans[0] = ans[pos[0]] * ans[pos[1]] / x;
	rep(i, 10) {
		if (ans[0] == i * i) {
			ans[0] = i;
			break;
		}
	}
	if (ans[0] == -1) {
		cout << "! " << -1 << endl;
		return 0;
	}
	rep2(i, 1, n)ans[i] /= ans[0];
	string s;
	rep(i, n)s += '0' + ans[i];
	cout << "! " << s << endl;
	return 0;
}