#include <bits/stdc++.h>

using namespace std;

#define int long long
#define fi first
#define se second
#define oo 1000000000000000000LL
#define pb push_back
#define ii pair<int, int>
#define iii pair<int, ii>
#define BIT(mask, i) ((mask) >> (i) & 1)
#define MASK(i) (1LL << (i))
#define TASK "TEST"

const int N = 200005;

int n, m, ans;
int f[N];
map<int, int> mp;
vector<int> v;

/// a[pos] += val
void update(int pos, int val) {
    for (int i = pos; i <= m; i += i & -i) f[i] += val;
}

/// a[1] + a[2] + ... + a[pos]
int get(int pos) {
    int res = 0;
    for (int i = pos; i; i -= i & -i) res += f[i];
    return res;
}

int sum(int l, int r) {
    return get(r) - get(l - 1);
}

void calc(int l, int r) {
    if (l <= r) {
        int cnt = upper_bound(v.begin(), v.end(), r) - lower_bound(v.begin(), v.end(), l);
        ans += r - l + 1 - cnt;
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    if (fopen(TASK".INP", "r")) {
        freopen(TASK".INP", "r", stdin);
        freopen(TASK".OUT", "w", stdout);
    }

    cin >> n;

    for (int i = 1; i <= n; i++) {
        int a, b;
        cin >> a >> b;

        int u = (mp[a] == 0 ? a : mp[a]), v = (mp[b] == 0 ? b : mp[b]);
        mp[b] = u;
        mp[a] = v;
    }

    for (ii e : mp) v.pb(e.se);

    sort(v.begin(), v.end());
    m = v.size();

    for (ii e : mp) {
        int pos = e.fi, val = e.se, x = lower_bound(v.begin(), v.end(), val) - v.begin() + 1;

        calc(val + 1, pos - 1);
        calc(pos + 1, val - 1);

        ans += sum(x + 1, m);
        update(x, 1);
    }

    cout << ans;
}