#include <iostream>
#include <algorithm>
#include <climits>
#define int long long
using namespace std;
const int N = 1e5 + 10;
int ans = LLONG_MAX;
int n, x, y;
int a[N], b[N], dx[N], dy[N];
int sx[N], sy[N];
signed main(){
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> x >> y;
		dx[i] = x + y;
		dy[i] = x - y;
		a[i] = dx[i];
		b[i] = dy[i];
	}
	sort(a + 1, a + n + 1);
	sort(b + 1, b + n + 1);
	for(int i = 1; i <= n; i++){
		sx[i] = sx[i - 1] + a[i];
		sy[i] = sy[i - 1] + b[i];
	}
	for(int i = 1; i <= n; i++){
		int k = 0;
		int xid = lower_bound(a + 1, a + n + 1, dx[i]) - a;
		int yid = lower_bound(b + 1, b + n + 1, dx[i]) - b;
		k += (2 * xid - n) * a[xid] + sx[n] - 2 * sx[xid];
		k += (2 * yid - n) * b[yid] + sy[n] - 2 * sy[yid];
		ans = min(ans, k);
	}
	cout << ans / 2;
}