#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n + 1); i++)
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;

int main(){
    int N;
    cin >> N;

    vector<int> X(N), Y(N);
    rep(i, N){
        cin >> X[i] >> Y[i];
    }

    vector<int> XS = X, YS = Y;
    sort(XS.begin(), XS.end());
    sort(YS.begin(), YS.end());

    int mx = XS[N/2], my = YS[N/2];

    ll ans = 0;
    rep(i, N){
        ans += abs(X[i]-mx) + abs(Y[i]-my);
    }

    cout << ans << "\n";
    return 0;
}