#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <cstring>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < int(n);i++)

int main(){
  int n;
  cin >> n;
  vector<int> x(n);
  vector<int> y(n);
  rep(i,n) cin >> x[i] >> y[i];
  sort(x.begin(),x.end());
  sort(y.begin(),y.end());
  int ansx,ansy;
  if (n%2 == 0){
    ansx = (x[n/2-1]+x[n/2])/2;
    ansy = (y[n/2-1]+y[n/2])/2;
  }
  else{
    ansx = x[n/2];
    ansy = y[n/2];
  }
  int ans = 0;
  for (int i = 0; i < n;i++){
    ans += abs(ansx-x[i])+abs(ansy-y[i]);
  }
  cout << ans << endl;

  return 0;
}