import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int M;
long[] X, Y;

void main() {
  M = readInt();
  X = new long[M];
  Y = new long[M];
  foreach (i; 0 .. M) {
    X[i] = readLong();
    Y[i] = readLong();
  }
  
  writeln("? 0 0");
  stdout.flush;
  const ax = readLong();
  const ay = readLong();
  writeln("? 1 0");
  stdout.flush;
  const bx = readLong();
  const by = readLong();
  writeln("? 0 1");
  stdout.flush;
  const cx = readLong();
  const cy = readLong();
  
  writeln("!");
  foreach (i; 0 .. M) {
    const ansX = ax + (bx - ax) * X[i] + (cx - ax) * Y[i];
    const ansY = ay + (by - ay) * X[i] + (cy - ay) * Y[i];
    writeln(ansX, " ", ansY);
  }
  stdout.flush;
}