#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 ax,ay;
  cin >> ax >> ay;

  cout << "? " << 1 << " " << 0 << endl;
  long long bx,by;
  cin >> bx >> by;

  long long dx = bx-ax;
  long long dy = by-ay;

  int rot;
  if(dx == 1){
    rot = 0;
  }else if(dx == -1){
    rot = 180;
  }else if(dy == 1){
    rot = 90;
  }else if(dy == -1){
    rot = 270;
  }

  cerr << rot << endl;

  double PI = acos(-1.0);

  vector<vector<long long>> A = {
    {round(cos(rot*PI/180.0)), round(-sin(rot*PI/180.0)), ax},
    {round(sin(rot*PI/180.0)), round(cos(rot*PI/180.0)), ay},
    {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;
}