from itertools import *
from bisect import *
from collections import *
from heapq import *
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    m=II()
    xy=LLI(m)
    print("? 0 0",flush=True)
    x0,y0=MI()
    print("? 1 0",flush=True)
    dx1,dy1=MI()
    print("? 0 1",flush=True)
    dx2,dy2=MI()
    dx1-=x0
    dx2-=x0
    dy1-=y0
    dy2-=y0
    print("!")
    for x,y in xy:
        ax=x0+x*dx1+y*dx2
        ay=y0+x*dy1+y*dy2
        print(ax,ay)

main()