#include <complex>
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <map>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <functional>
#include <random>
#include <ctime>
#include "assert.h"

using namespace std;

//[n*p] * [p*m] => [n*m]
template<class T>
vector< vector<T> > multmat(const vector<vector<T> > &A, const vector<vector<T>> &B, int n, int p, int m){
  vector<vector<T> > C(n, vector<T>(m,0));
  for(int i=0; i<n; i++){
    for(int k=0; k<p; k++){
      for(int j=0; j<m; j++){
        C[i][j] += A[i][k] * B[k][j];
        //C[i][j] %= mod;
      }
    }
  }
  return C;
}

int main(int argc, char* argv[]){
	int m;
	cin >> m;
	vector<long long> px(m), py(m);
	for(int i=0; i<m; i++){
		cin >> px[i] >> py[i];
	}

  cout << "? " << 0 << " " << 0 << endl;
  long long dx,dy;
  cin >> dx >> dy;

  cout << "? " << 1 << " " << 0 << endl;
  vector<long long> r(4);
  cin >> r[0] >> r[2];
  r[0] -= dx;
  r[2] -= dy;

  cout << "? " << 0 << " " << 1 << endl;
  cin >> r[1] >> r[3];
  r[1] -= dx;
  r[3] -= dy;

  vector<vector<long long>> A = {
    {r[0],r[1],dx},
    {r[2],r[3],dy},
    {0,0,1}
  };

  cout << "!" << endl;
  for(int i=0; i<m; i++){
    vector<vector<long long>> v = {
      {px[i]},
      {py[i]},
      {1}
    };

    auto ans = multmat(A, v, 3,3,1);
    cout << ans[0][0] << " " << ans[1][0] << endl;
  }



	return 0;
}