#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
ll MOD;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

/////////////////////////////////////
int main() {
	ll N;
	cin >> N;
	vll l(N + 1), r(N + 1);
	repn(i, N)cin >> l[i] >> r[i];
	vll s(N + 1);
	repn(i, N)s[i] = r[i] - l[i];
	
	priority_queue<ll> lef;
	priority_queue<ll, vector<ll>, greater<ll>> ri;
	ll ruilef = 0;
	ll ruiri = 0;

	ll ans = 0;
	repn(i, N) {

		ll v = 0;
		ll w = 0;
		if (i > 1) {
			v = lef.top() + ruilef;
			w = ri.top() + ruiri;
		}
		//cout << v << " " << w << endl;
			
		ll x = l[i];
		ri.push(x-ruiri);
		ll y = ri.top();
		ri.pop();
		y = y + ruiri - ruilef;
		lef.push(y);

		lef.push(x-ruilef);
		y = lef.top();
		lef.pop();
		y = y + ruilef - ruiri;
		ri.push(y);

		
		if (i > 1) {
			if (v == ri.top() + ruiri) {
				ans += abs(x - v);
			}
			else if (w == lef.top() + ruilef) {
				ans += abs(x - w);
			}
		}

		if (i < N) {
			ruilef -= s[i + 1];
			ruiri += s[i];
		}

		
	}

	cout << ans << endl;
	return 0;

	multiset<ll> st;
	while (!lef.empty()) {
		ll x = lef.top();
		lef.pop();
		st.insert(x + ruilef);
		cout << x + ruilef << endl;
	}
	cout << endl;
	while (!ri.empty()) {
		ll x = ri.top();
		ri.pop();
		st.insert(x + ruiri);
		cout << x + ruiri << endl;
	}

	cout << st.size() << endl;
	ll now = 0;
	ll t = *st.begin();
	repn(i, N) {
		now += abs(l[i] - t);
		t += s[i];
	}
	//ll ans = now;

	repn(i, 2*N-1) {
		ll x = *st.begin();
		st.erase(st.begin());
		ll y = *st.begin();
		now += (-N + i) * (y - x);
		ans = min(ans, now);
	}

	//cout << ans << endl;


	


}


Measured memory_bytes: 7356