import sys
input = sys.stdin.readline

N = int(input())

# Step 1: queries
p = []
for i in range(N-1):
    print(f"? {i} {i+1}", flush=True)
    x = int(input())
    if x == -1:
        exit()
    p.append(x)

# Step 2: enumerate all sequences
candidates = []

def dfs(i, digits):
    if i == N:
        candidates.append(digits[:])
        return
    
    for d in range(10):
        if digits[i-1] * d == p[i-1]:
            digits[i] = d
            dfs(i+1, digits)

# try all starting pairs
for d0 in range(10):
    for d1 in range(10):
        if d0 * d1 != p[0]:
            continue
        
        digits = [0]*N
        digits[0] = d0
        digits[1] = d1
        
        dfs(2, digits)

# Step 3: deduplicate
unique = set(tuple(d) for d in candidates)

# Step 4: output
if len(unique) == 1:
    ans = list(unique)[0]
    print(f"! {''.join(map(str, ans))}", flush=True)
else:
    print("! -1", flush=True)