#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

template<class T> ostream& operator<<(ostream& os, const vector<T>& vec) {
    for (auto &vi: vec) os << vi << " "; return os;
}
template<class T> struct Matrix {
    vector<vector<T>> val;
    Matrix(int n = 1, int m = 1, T x = 0) { val.assign(n, vector<T>(m, x)); }
    size_t size() const { return val.size(); }
    vector<T>& operator[](int i) { return val[i]; }
    const vector<T>& operator[](int i) const { return val[i]; }
    friend ostream& operator<<(ostream& os, const Matrix<T> M) {
        for (int i = 0; i < M.size(); ++i) os << M[i] << " \n"[i != M.size() - 1];
        return os;
    }
};
template<class T> Matrix<T> operator^(Matrix<T> A, long long n) {
    Matrix<T> R(A.size(), A.size());
    for (int i = 0; i < A.size(); ++i) R[i][i] = 1;
    while (n > 0) { if (n & 1) R = R * A; A = A * A; n >>= 1; }
    return R;
}
template<class T> Matrix<T> operator*(const Matrix<T>& A, const Matrix<T>& B) {
    Matrix<T> R(A.size(), B[0].size());
    for (int i = 0; i < A.size(); ++i) for (int j = 0; j < B[0].size(); ++j)
        for (int k = 0; k < B.size(); ++k) R[i][j] += A[i][k] * B[k][j];
    return R;
}
template<class T> vector<T> operator*(const Matrix<T> &A, vector<T> &B) {
    vector<T> v(A.size());
    for (int i = 0; i < A.size(); ++i)
        for (int k = 0; k < B.size(); ++k) v[i] += A[i][k] * B[k];
    return v;
}
template<class T> T affine2(T a, T b, long long n, T x1 = 1) {
    Matrix<T> A(2, 2);
    A[0][0] = a; A[0][1] = b;                   // x[k + 1] = a * x[k] + b
    A[1][0] = 0; A[1][1] = 1;
    auto pow = A ^ (n - 1);
    return pow[0][0] * x1 + pow[0][1];
}
template<class T>
Matrix<T> affine2D(T p = T(1), T q = T(0), T r = T(0), T s = T(1), T b1 = T(0), T b2 = T(0)) {
    Matrix<T> A(3, 3);
    A[0][0] = p; A[0][1] = q; A[0][2] = b1;     // ⎛y1⎞   ⎛p q⎞ ⎛x1⎞   ⎛b1⎞
    A[1][0] = r; A[1][1] = s; A[1][2] = b2;     // ⎝y2⎠ = ⎝r s⎠ ⎝x2⎠ * ⎝b2⎠
    A[2][0] = 0; A[2][1] = 0; A[2][2] =  1;
    return A;
}
template<class T> Matrix<T> rot(T theta) {
    return affine2D(cos(theta), -sin(theta), sin(theta), cos(theta), 0, 0);
}
template<class T> Matrix<T> rot_cw90() { return affine2D(T(0), T(1), -T(1), T(0), T(0), T(0)); }
template<class T> Matrix<T> rot_ccw90() { return affine2D(T(0), -T(1), T(1), T(0), T(0), T(0)); }
template<class T> Matrix<T> trans(T b1, T b2) { return affine2D(T(1), T(0), T(0), T(1), b1, b2); }

int main() {
    int n; cin >> n;
    vector<vector<int>> p(n, vector<int>(3, 1));
    for (int i = 0; i < n; i++) cin >> p[i][0] >> p[i][1];
    cout << "? 0 0" << endl;
    int dx, dy; cin >> dx >> dy;
    cout << "? 1 0" << endl;
    int a, c; cin >> a >> c; a -= dx, c -= dy;
    cout << "? 0 1" << endl;
    int b, d; cin >> b >> d; b -= dx, d -= dy;
    Matrix<int> affine = affine2D(a, b, c, d, dx, dy);
    cout << "!" << endl;
    for (int i = 0; i < n; i++) {
        auto res = affine * p[i];
        cout << res[0] << " " << res[1] << endl;
    }
    return 0;
}