#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }

int main() {
	int M;
	while (~scanf("%d", &M)) {
		vector<int> xs(M);
		vector<int> ys(M);
		for (int i = 0; i < M; ++i)
			scanf("%d%d", &xs[i], &ys[i]);
		auto query = [](int x, int y) {
			printf("? %d %d\n", x, y);
			fflush(stdout);
			int a; int b;
			scanf("%d%d", &a, &b);
			return make_pair(a, b);
		};
		auto zero = query(0, 0);
		auto x1 = query(1, 0);
		auto y1 = query(0, 1);
		int addx = zero.first, addy = zero.second;
		int xtox = x1.first - addx, xtoy = x1.second - addy;
		int ytox = y1.first - addx, ytoy = y1.second - addy;
		puts("!");
		rep(i, M) {
			int x = xs[i] * xtox + ys[i] * ytox + addx;
			int y = xs[i] * xtoy + ys[i] * ytoy + addy;
			printf("%d %d\n", x, y);
		}
		fflush(stdout);
	}
	return 0;
}