#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream> 
using namespace std;

#define int long long
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back

const int MOD = 998244353;//
const int FACTMAX = 2000005;//
const int CATALANMAX = 1000005;//

int fact[FACTMAX], invfact[FACTMAX], cat[CATALANMAX];

int expo(int a, int b){
	int res=1;
	a%=MOD;
	while (b){
		if (b&1)res=(res*a)%MOD;
		a=(a*a)%MOD;
		b>>=1;
	}
	return res;
}

int inv(int num){
	return expo(num, MOD-2);
}

void initfact(){
	fact[0]=1;
	for (int i=1; i<FACTMAX; ++i)fact[i]=(fact[i-1]*i)%MOD;
	invfact[FACTMAX-1]=inv(fact[FACTMAX-1]);
	for (int i=FACTMAX-2; i>=0; --i)invfact[i]=(invfact[i+1]*(i+1))%MOD;
}
 
int ncr(int n, int r){
	if (n<r||r<0)return 0;
	return (((fact[n]*invfact[r])%MOD)*invfact[n-r])%MOD;
}

int gcd(int a, int b){
	while (b){
		int t=a%b;
		a=b;
		b=t;
	}
	return a;
}

int lcm(int a, int b){
	int temp=gcd(a, b);
	a/=temp;
	b/=temp;
	return a*b*temp;
}

void initcatalan(int k){
	cat[0]=1;
	for (int i=1; i<CATALANMAX; ++i)cat[i]=(((fact[2*i]*invfact[i])%MOD)*invfact[i+1])%MOD;
}

int query(int a, int b) {
	cout<<"? "<<a<<" "<<b<<endl;
	int x;
	cin>>x;
	if (x==-1)exit(0);
	return x;
}

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	initfact();
	int t=1;
	//cin>>t;
	while (t--){
		int n, r=-1, a=-1, b=-1;
		cin>>n;
		vector<int> p(n-1), pos;
		for (int i=0; i<n-1; ++i){
			p[i]=query(i, n-1);
			if (p[i])pos.pb(i);
		}
		if (pos.size()>=2)a=pos[0], b=pos[1], r=query(a, b);
		vector<string> ans;
		for (int i=1; i<=9; ++i){
			vector<int> d(n);
			d[n-1]=i;
			bool can=1;
			for (int j=0; j<n-1; ++j){
				if (p[j]%i)can=0;
				else{
					d[j]=p[j]/i;
					if (d[j]>9)can=0;
				}
			}
			if (can&&r!=-1&&d[a]*d[b]!=r)can=0;
			if (!can)continue;
			string s="";
			for (int j=n-1; j>=0; --j)s+='0'+d[j];
			ans.pb(s);
		}
		if (ans.size()==1)cout<<"! "<<ans[0]<<endl;
		else cout<<"! -1"<<endl;
	}
}