#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 998244353, N = 400005;
typedef pair<int, int> pi;

int c[N];

struct seg {
    int l, r, cnt, lz;
    ll v;
    seg *ch[2]{};
    seg(int _l, int _r) : l(_l), r(_r), lz(0), v(0) {
        if (l < r - 1)
            ch[0] = new seg(l, l + r >> 1), ch[1] = new seg(l + r >> 1, r), cnt = ch[0]->cnt + ch[1]->cnt;
        else
            cnt = c[l];
    }
    seg(seg *oth) : l(oth->l), r(oth->r), cnt(oth->cnt), lz(oth->lz), v(oth->v), ch{oth->ch[0], oth->ch[1]} {}
    void push() {
        if (lz)
            ch[0] = ch[0]->modify(l, r, lz), ch[1] = ch[1]->modify(l, r, lz), lz = 0;
    }
    void pull() {
        v = ch[0]->v + ch[1]->v;
    }
    seg* modify(int _l, int _r, int d) {
        seg* tmp = new seg(this);
        if (_l <= l && r <= _r) {
            tmp->lz += d;
            tmp->v += 1ll * d * cnt;
            return tmp;
        }
        tmp->push();
        if (_l < l + r >> 1)
            tmp->ch[0] = tmp->ch[0]->modify(_l, _r, d);
        if (l + r >> 1 < _r)
            tmp->ch[1] = tmp->ch[1]->modify(_l, _r, d);
        tmp->pull();
        return tmp;
    }
};

int main() {
	ios::sync_with_stdio(false), cin.tie(0);
    int n;
    cin >> n;
    pi a[n];
    int id[2 * n];
    ll ans[n];
    for (int i = 0; i < n; ++i) {
        cin >> a[i].first >> a[i].second;
        id[--a[i].first] = id[--a[i].second] = i;
        ans[i] = n - 1;
    }
    for (int i = 0; i < 2 * n; ++i)
        c[i] = i == a[id[i]].first ? 1 : 0;
    queue<int> q;
    seg *rt = new seg(0, 2 * n);
    vector<seg*> rts(n, nullptr);
    int R = 2 * n;
    for (int i = 2 * n - 1; ~i; --i) {
        int x = id[i];
        if (i == a[x].second) {
            while (!q.empty() && a[q.front()].first > i)
                q.pop();
            if (q.empty())
                rts[x] = rt, R = i;
            else {
                rts[x] = rts[q.front()]->modify(i + 1, R, 1);
                ans[x] += rts[x]->v;
            }
            q.push(x);
        }
    }
    while (!q.empty())
        q.pop();
    rts.assign(n, nullptr);
    for (int i = 0; i < 2 * n; ++i)
        c[i] = i == a[id[i]].second ? 1 : 0;
    rt = new seg(0, 2 * n);
    int L = 0;
    for (int i = 0; i < 2 * n; ++i) {
        int x = id[i];
        if (i == a[x].first) {
            while (!q.empty() && a[q.front()].second < i)
                q.pop();
            if (q.empty())
                rts[x] = rt, L = i;
            else {
                rts[x] = rts[q.front()]->modify(L, i, 1);
                ans[x] += rts[x]->v;
            }
            q.push(x);
        }
    }
    for (int i = 0; i < n; ++i)
        cout << ans[i] << '\n';
}