from math import gcd
n=int(input())
a=1
while a<n:
	a+=1
	g=gcd(n,a)
	if g>1:break
	print("?",a)
	r=int(input())
	if r%2>0:continue
	t=pow(a,r//2,n)
	g=max(gcd(n,t-1)%n,gcd(n,t+1)%n)
	if g>1:break
print("!",g,n//g)