#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#include <bits/stdc++.h>

#define el '\n'
#define F first
#define S second

typedef long long ll;
typedef long double ld;
typedef __int128 bigInt;

using namespace std;

const int N = 5e5 + 5, INF = 1e9 + 5, mod = 1e9 + 7, LOG = 21, SQ = 500;



void doWork() {
    int n, mnx = INF, mxx = -INF, mny = INF, mxy = -INF;
    cin >> n;
    vector<pair<int, int>> v(n);

    for (auto &i : v) {
        cin >> i.F >> i.S;
        mxx = max(mxx, i.F);
        mnx = min(mnx, i.F);
        mny = min(mny, i.S);
        mxy = max(mxy, i.S);
    }

    pair<int, int> p = {(mxx + mnx) / 2, (mxy + mny) / 2};

    int x = 0, y = 0;

    for (auto &i : v) {
        x = max(x, abs(p.F - i.F));
        y = max(y, abs(p.S - i.S));
    }

    cout << x << ' ' << y << el;
}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int tests = 1;
//    cin >> tests;
    for (int i = 1; i <= tests; i++) {
        doWork();
    }
}