#include <bits/stdc++.h>
using namespace std;
long long n, a[100005], b[100005], mida, midb, ans;
int main()
{
	cin >> n;
	for (int i = 1;i <= n;i++)
	{
		cin >> a[i] >> b[i];
	}
	sort (a + 1, a + n + 1);
	sort (b + 1, b + n + 1);
	mida = a[(1 + n) / 2];
	midb = b[(1 + n) / 2];
	for (int i = 1;i <= n;i++)
	{
		ans += abs(mida - a[i]) + abs(midb - b[i]);
	}
	cout << ans;
	return 0;
}