#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")


#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

int main(){
  ll n;cin >> n;
  vl x(n),y(n);
  rep(i,n)cin >> x[i] >> y[i];
  cout << "? 0 0" << endl;
  ll a,b;cin >>a >> b;
  cout << "? 1 0" << endl;
  ll c,d;cin >> c >> d;
  c-=a;d-=b;
  cout << "!" << endl;
  if(c==1){
    rep(i,n)cout << x[i]+a <<" " << y[i]+b << endl;
  }
  else if(c==-1){
    rep(i,n)cout << a-x[i] <<" " << b-y[i] << endl;
  }
  else if(d==1){
    rep(i,n)cout << a-y[i] <<" " << b+x[i] << endl;
  }
  else{
    rep(i,n)cout << a+y[i] <<" " << b-x[i] << endl;
  }
}