#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = a, I = b; i <= I; ++i)
#define per(i, a, b) for (int i = a, I = b; i >= I; --i)
template<typename T> void up(T &x, T y) { if (x < y) x = y; }
template<typename T> void down(T &x, T y) { if (x > y) x = y; }

int n, l[200005], r[200005], sum[400005], lp[400005], g[400005], h[400005];
i64 f[400005], ans[200005];

void solve() {
    memset(sum, 0, sizeof sum);
    memset(lp, 0x3f, sizeof lp);
    rep(i, 1, n) ++sum[r[i]], down(lp[r[i]], l[i]);
    rep(i, 1, 2 * n) sum[i] += sum[i - 1];
    per(i, 2 * n, 1) down(lp[i], lp[i + 1]);

    rep(i, 1, 2 * n) {
        if (lp[i] > n) break;
        if (lp[i] >= i) {
            g[i] = i;
            f[i] = h[i] = 0;
        } else {
            g[i] = g[lp[i]];
            f[i] = f[lp[i]] + sum[i - 1];
            h[i] = h[lp[i]] + 1;
        }
    }

    rep(i, 1, n) {
        int x = l[i], y = g[x];
        ans[i] += f[x];
        ans[i] -= 1ll * sum[y - 1] * (h[x] + 1);
    }
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);

    cin >> n;
    rep(i, 1, n) cin >> l[i] >> r[i], ans[i] = n - 1;

    solve();
    rep(i, 1, n) {
        l[i] = 2 * n - l[i] + 1;
        r[i] = 2 * n - r[i] + 1;
        swap(l[i], r[i]);
    }
    solve();

    rep(i, 1, n) cout << ans[i] << "\n";

    return 0;
}