#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    int N, ans=1e9, cnt;
    cin >> N;
    vector<int> X(N), Y(N);
    for (int i=0; i<N; i++) cin >> X[i] >> Y[i];

    for (int i=1; i<=300; i++){
        for (int j=1; j<=300; j++){
            cnt = 0;
            for (int k=0; k<N; k++) cnt += abs(i-X[k]) + abs(j-Y[k]);
            ans = min(ans, cnt);
        }
    }

    cout << ans << endl;

    return 0;
}