#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <limits>

using namespace std;

int main()
{
int min = numeric_limits<int>::max();
int max = numeric_limits<int>::min();
int N;
cin >> N; cin.ignore();
int ys[N];
for (int i = 0; i < N; i++) {
int a,b;
cin >> a >> b; cin.ignore();
ys[i] = b;
if (a > max) max = a;
if (a < min) min = a;
}
sort(ys,ys+N);
int median = ys[N/2];
if (N%2 == 0) median = (ys[N/2]+ys[(N/2)+1])/2;
int res = max-min;
for (int i = 0; i<N ; i++)
{
res += abs(ys[i]-median);
}
cout <<abs(res);
}