Problem: Annie has gotten bored of winning every coding contest and farming unlimited rating. Today, she is going to farm potatoes instead.

Annie's garden is an infinite 2D plane. She has n potatoes to plant, and the i-th potato must be planted at (x_i,y_i). Starting at the point (0, 0), Annie begins walking, in one step she can travel one unit right or up (increasing her x or y coordinate by 1 respectively). At any point (X,Y) during her walk she can plant some potatoes at arbitrary points using her potato gun, consuming max(|X-x|,|Y-y|) units of energy in order to plant a potato at (x,y). Find the minimum total energy required to plant every potato.

Note that Annie may plant any number of potatoes from any point.

Input

The first line contains the integer n (1 ≤ n ≤ 800 000).

The next n lines contain two integers x_i and y_i (0 ≤ x_i,y_i ≤ 10^9), representing the location of the i-th potato. It is possible that some potatoes should be planted in the same location.

Output

Print the minimum total energy to plant all potatoes.

Examples

Input


2
1 1
2 2


Output


0


Input


2
1 1
2 0


Output


1


Input


3
5 5
7 7
4 9


Output


2


Input


10
5 1
4 0
9 6
0 2
10 1
9 10
3 10
0 10
8 9
1 5


Output


19


Input


10
1 1
2 2
2 0
4 2
4 0
2 0
0 2
4 0
4 2
5 1


Output


6

Note

In example 1, Annie can travel to each spot directly and plant a potato with no energy required.

In example 2, moving to (1,0), Annie plants the second potato using 1 energy. Next, she travels to (1,1) and plants the first potato with 0 energy.

Solution (in CPP):

Solution:
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define REP(u) for(int i=p[u];i!=-1;i=e[i].nxt)
#define sz(x) (int)(x.size())
#define PII pair<int,int>
#define ll long long
#define pb push_back
#define gc (p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2))?EOF:*p1++;
#define iter set<int>::iterator
using namespace std;
char buf[100000],*p1=buf,*p2=buf;
inline int gi()
{
	int x=0,f=1;char ch=gc;
	while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=gc;}
	while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48),ch=gc;}
	return (f==1)?x:-x;
}
const int maxn=8e5+5;
int n,x[maxn],y[maxn],id[maxn];
ll ans;
inline void input()
{
	n=gi();
	FOR(i,1,n)
	{
		int u=gi(),v=gi();
		x[i]=(u+v),y[i]=(u-v);
		id[i]=i;
	}
	sort(id+1,id+n+1,[](int i,int j){return x[i]==x[j]?y[i]<y[j]:x[i]<x[j];}); 
}
inline void solve()
{
	priority_queue<int>pl;
	priority_queue<int,vector<int>,greater<int>>pr;
	int now=0;
	FOR(i,1,n+5)pl.push(0),pr.push(0);
	//pl.push(0),pr.push(0);
	//pl.push(y[id[1]]),pr.push(y[id[1]]);
	//pl.push(-x[id[1]]),pr.push(x[id[1]]);
	FOR(i,1,n)
	{
		now+=x[id[i]]-x[id[i-1]];
		int L=pl.top()-now,R=pr.top()+now;
		if(L<=y[id[i]]&&y[id[i]]<=R)pl.push(y[id[i]]+now),pr.push(y[id[i]]-now);
		else if(y[id[i]]<L)
		{
			ans+=L-y[id[i]];
			pl.push(y[id[i]]+now),pl.push(y[id[i]]+now);
			pl.pop();pr.push(L-now);
		}
		else
		{
			ans+=y[id[i]]-R;
			pr.push(y[id[i]]-now),pr.push(y[id[i]]-now);
			pr.pop(),pl.push(R+now);
		}
	}
	//assert(ans%2==0);
	printf("%lld\n",ans/2);
}
int main()
{
	input();
	solve();
	return 0;
}