#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

void o() {
    fflush(stdout);
}

pair<ll, ll> q(int x, int y) {
    printf("? %d %d\n", x, y);
    o();
    ll xx, yy;
    scanf("%lld%lld", &xx, &yy);
    return mp(xx, yy);
}

int main(){
    int M;
    scanf("%d", &M);
    vi X(M), Y(M);
    rep(i, M) {
        scanf("%d%d", &X[i], &Y[i]);
    }

    // |a b e|
    // |c d f|
    // |0 0 1|
    
    ll a, b, c, d, e, f, g, h;
    tie(e, f) = q(0, 0);
    tie(a, c) = q(1, 0);
    tie(b, d) = q(0, 1);
    a -= e; b -= e; c -= f; d -= f;

    printf("!\n");
    rep(i, M) {
        ll x = X[i], y = Y[i];
        ll xx = a*x + b*y + e, yy = c*x + d*y + f;
        printf("%lld %lld\n", xx, yy);
    }
    o();
}