#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
int ask(int a,int b) {
	cout<<"? "<<a<<" "<<b<<endl;
	cin>>a;
	return a;
}

void out(string v) {
	cout<<"! "<<v<<endl;
	exit(1);
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	if(N==2) {
		x=ask(0,1);
		if(x==1) out("11");
		if(x==25) out("55");
		if(x==49) out("66");
		if(x==64) out("77");
		if(x==81) out("88");
		out("-1");
	}
	string S;
	S.resize(N);
	
	int ret[55];
	vector<int> cand;
	FOR(i,N-1) {
		ret[i]=ask(i,N-1);
		if(ret[i]==0) {
			S[i]='0';
		}
		else {
			cand.push_back(i);
		}
	}
	if(cand.size()==0) {
		out("-1");
	}
	else if(cand.size()==1) {
		x=ret[cand[0]];
		if(x==1) S[0]=S[N-1-x]='1';
		else if(x==25) S[0]=S[N-1-x]='5';
		else if(x==49) S[0]=S[N-1-x]='6';
		else if(x==64) S[0]=S[N-1-x]='7';
		else if(x==81) S[0]=S[N-1-x]='8';
		else S="-1";
		out(S);
	}
	
	y=ask(cand[0],cand[1]);
	for(i=1;i<=9;i++) for(j=1;j<=9;j++) for(k=1;k<=9;k++) {
		if(ret[cand[0]]==k*i&&ret[cand[1]]==k*j&&y==i*j) {
			S[0]=k+'0';
			FORR(a,cand) S[a]=ret[a]/k+'0';
			out(S);
		}
	}
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}