program p1440;
type arr=array[1..10001]of longint;
var x,y:array[1..10001]of longint;
i,n,mx,my,ans:longint;
procedure qsort(l,r:longint;var c:arr);
var i,j,mid,tmp:longint;
begin
i:=l;
j:=r;
mid:=c[(l+r) div 2];
repeat
while c[i]<mid do
inc(i);
while c[j]>mid do
dec(j);
if i<=j then
begin
tmp:=c[i];c[i]:=c[j];c[j]:=tmp;
inc(i);
dec(j);
end;
until i>j;
if l<j then qsort(l,j,c);
if i<r then qsort(i,r,c);
end;

begin
readln(n);
for i:=1 to n do
readln(x[i],y[i]);
qsort(1,n,y);
qsort(1,n,x);
ans:=0;
my:=y[(1+n) div 2];
mx:=x[(1+n) div 2];
for i:=1 to n do
ans:=ans+abs(y[i]-my)+abs(mx-(1+n)div 2+i-x[i]);
writeln(ans);
end.