# import pypyjit;pypyjit.set_param("max_unroll_recursion=-1")
# from bisect import *
# from collections import *
# from heapq import *
# from itertools import *
# from math import *
# from datetime import *
# from decimal import*
# from string import ascii_lowercase,ascii_uppercase
# import numpy as np
import sys
import os

# sys.setrecursionlimit(10**6)
INF = 10**18
MOD = 998244353
# MOD = 10**9 + 7
File = open("input.txt", "r") if os.path.exists("input.txt") else sys.stdin


def input():
    return File.readline()[:-1]


# ///////////////////////////////////////////////////////////////////////////
# testA = 15
# testB = 20

x1 = 2
print("? " + str(x1), flush=True)
m1 = int(input())
# if m1 == 0:
#     assert False
# m1 = (testA + x1) % testB
x2 = 99
print("? " + str(x2), flush=True)
m2 = int(input())
# m2 = (testA + x2) % testB
# print(m1, m2)

for i in range(1, 101):
    for j in range(i + 1, 101):
        res1 = (i + x1) % j == m1
        res2 = (i + x2) % j == m2
        if res1 and res2:
            print("!", i, j)
            exit()