#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
long long primeNumber(long long x) {
  bool fire = true;
  for(int i = 2; i <= sqrt(x); i++) {
    if(x % i == 0) {
      fire = false;
    }
  }
  return fire;
}
int main() {
  int N; cin >> N;
  vector<pair<int,int>> A(N);
  for(int i = 0; i < N; i++) {
    int a,b; cin >> a >> b;
    A[i] = {a,b};
  }
  int ans = 1000000;
  for(int i = 0; i <= 301; i++) {
    for(int j = 0; j <= 301; j++) {
      int sum = 0;
      for(int l =0; l < N; l++) {
        int x = A[l].first;
        int y = A[l].second;
        int X = abs(x - i);
        int Y = abs(y - j);
        sum += (X + Y);
      }
      ans = min(sum,ans);
    }
  }
  cout << ans << endl;
}