#include <bits/stdc++.h>

#include <atcoder/fenwicktree.hpp>
#include <atcoder/segtree.hpp>
#include <atcoder/modint.hpp>
#include <atcoder/dsu.hpp>
#include <atcoder/lazysegtree.hpp>

using namespace atcoder;
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class T>
using max_heap = priority_queue<T>;
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<>>;
ll ll_min = numeric_limits<ll>::min();
ll ll_max = numeric_limits<ll>::max();
ll ALPHABET_N = 26;
// using mint = modint998244353;
#define rep(i, n) for (ll i = (ll)0; i < (ll)n; i++)
#define rep_(i, k, n) for (ll i = (ll)k; i < (ll)n; i++)
#define all(a) a.begin(), a.end()

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	ll n;
	cin >> n;
	ll MX = 1000010;
	fenwick_tree<ll> ft_l(1000010), ft_r(1000010);
	ll ans = 0;
	vector<ll> L(n), R(n);
	rep(i, n)
	{
		cin >> L[i] >> R[i];
	}
	rep(i, n)
	{
		ll l = L[i];
		ll r = R[i];
		l--;
		r--;
		ll L1 = ft_l.sum(0, l);
		ll R1 = ft_r.sum(r, MX);
		ans += L1 + R1 - i;
		ft_l.add(l, 1);
		ft_r.add(r, 1);
	}
	cout << ans << endl;
	return 0;
}