#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}

long long mod_exp(long long b, long long e, long long m) {
    if (e > 0 && b == 0) return 0;
    long long ans = 1;
    b %= m;

    while (e > 0) {
        if ((e & 1LL)) ans = (ans * b) % m;
        e = e >> 1LL;
        b = (b * b) % m;
    }

    return ans;
}


int main()
{

    int Q;
    Q = 1;
    //cin >> Q;



    while (Q--) {
        int n;
        cin >> n;
        
        vector<int>t(n), r(n);
        for (int i = 0; i < n; i++) {
            
            cin >> t[i] >> r[i];
           
        }
        

       
        ll p = 1e10;
        pair<int, int>ans;
        for (int i = 0; i <= 300; i++) {
            for (int j = 0; j <= 300; j++) {
                ll x = 0;
                for (int k = 0; k < n; k++) {
                    x += abs(i - t[k]) + abs(j - r[k]);
                }
                if (x < p) {
                   ans.first = i; ans.second = j;
                    p = x;
                }
            }
        }
        cout << p;

    }
        return 0;
    }