#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,a[100005],b[100005],ans;
set<pair<int,pair<int,int> > >s00,s01,s10,s11;
void ins(int x,int y){
//	cout<<"ins"<<x<<' '<<y<<endl;
	ans+=abs(a[x]-b[y]);
	s00.insert({-a[x]-b[y]-abs(a[x]-b[y]),{x,y}});
	s01.insert({-a[x]+b[y]-abs(a[x]-b[y]),{x,y}});
	s10.insert({a[x]-b[y]-abs(a[x]-b[y]),{x,y}});
	s11.insert({a[x]+b[y]-abs(a[x]-b[y]),{x,y}});
}
void del(int x,int y){
//	cout<<"del"<<x<<' '<<y<<endl;
	ans-=abs(a[x]-b[y]);
	s00.erase(s00.find({-a[x]-b[y]-abs(a[x]-b[y]),{x,y}}));
	s01.erase(s01.find({-a[x]+b[y]-abs(a[x]-b[y]),{x,y}}));
	s10.erase(s10.find({a[x]-b[y]-abs(a[x]-b[y]),{x,y}}));
	s11.erase(s11.find({a[x]+b[y]-abs(a[x]-b[y]),{x,y}}));
}
signed main(){
	cin>>n;
	for(int i=1;i<=n;i++)
	cin>>a[i]>>b[i];
	ins(1,1);
	for(int i=2;i<=n;i++){
		int m00=(*s00.rbegin()).first+a[i]+b[i];pair<int,int>p00=(*s00.rbegin()).second;
		int m01=(*s01.rbegin()).first-a[i]+b[i];pair<int,int>p01=(*s01.rbegin()).second;
		int m10=(*s10.rbegin()).first+a[i]-b[i];pair<int,int>p10=(*s10.rbegin()).second;
		int m11=(*s11.rbegin()).first+a[i]-b[i];pair<int,int>p11=(*s11.rbegin()).second;
		int mx=max(max(m00,m01),max(m10,m11));
		if(m00==mx){
			del(p00.first,p00.second);
			ins(p00.first,i);ins(i,p00.second);
		}
		else if(m01==mx){
			del(p01.first,p01.second);
			ins(p01.first,i);ins(i,p01.second);
		}
		else if(m10==mx){
			del(p10.first,p10.second);
			ins(p10.first,i);ins(i,p10.second);
		}
		else if(m11==mx){
			del(p11.first,p01.second);
			ins(p11.first,i);ins(i,p11.second);
		}
	}
	cout<<ans<<endl;
	return 0;
}