n=int(input())
d=[[1]*10 for _ in range(n)]
d[0][0]=0
ok=0
k=[[-1]*n for _ in range(n)]
for l in range(n):
  k[l][l]=0
def chk():
  global d,k
  ret=-1
  for l in range(n):
    for i in range(10):
      if d[l][i]==0:
        continue
      ok=f=0
      for r in range(n):
        if r==l or k[l][r]<0:
          continue
        for j in range(10):
          if d[r][j]==0:
            continue
          f|=1<<r
          if k[l][r]==i*j:
            ok|=1<<r
      if ok!=f:
        d[l][i]=0
      if d[l].count(1)==1:
        idx=d[l].index(1)
        ans[l]=idx
        if idx:
          ret=l
  return ret
ans=[-1]*n
m=n
for l in range(n):
  if ans[l]!=-1:
    continue
  for r in range(n):
    if k[l][r]!=-1 or ans[r]!=-1:
      continue
    m-=1
    print('?',l,r)
    k[l][r]=k[r][l]=int(input())
    b=chk()
    if b!=-1 or m==0:
      break
  if b!=-1 or m==0:
    break
while m:
  f=0
  for l in range(n):
    if ans[l]!=-1 or b==l:
      continue
    for r in range(n):
      if b==-1:
        if k[r][l]!=-1 or l==r:
          continue
        m-=1
        print('?',r,l)
        k[r][l]=k[l][r]=int(input())
        f=1
        b=chk()
        if m==0:
          break
      else:
        if k[b][l]!=-1:
          continue
        m-=1
        print('?',b,l)
        k[b][l]=k[l][b]=p=int(input())
        ans[l]=p//ans[b]
        f=1
        chk()
        if m==0:
          break
  if not f:
    break
if -1 in ans:
  ans=['-1']
print('!',''.join(str(i)for i in ans))