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

int main(){
    int n; cin>>n;
    vector<pair<int, int>> location; vector<int> distance;
    for(int i = 0; i < n; i++){
        int a, b; cin>>a>>b;
        location.push_back(make_pair(a, b));
    }
    for(int i = 0; i < n-1; i++){
        int x1 = location[i].first, y1 = location[i].second;
        int x2 = location[i+1].first, y2 = location[i+1].second;
        int dis = abs(x1 - x2) + abs(y1 - y2); distance.push_back(dis);
    }
    int maxDistance = *max_element(distance.begin(), distance.end());
    int minDistance = *min_element(distance.begin(), distance.end());
    cout<<maxDistance<<" "<<minDistance<<endl;
}

不客氣