#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "../debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <class T> struct Stree {
	int n; T neut = -1e9;
	vector <T> tree;
	Stree(int n) : n(n) { tree.assign((n + 1) << 1, neut); }
	T merge(T &a, T &b) { return max(a, b); }
	void update(int k, T x) {
		k += n;
		tree[k] = merge(tree[k], x);
		for (k >>= 1; k; k >>= 1) tree[k] = merge(tree[k << 1], tree[k << 1 | 1]);
	}
	T query(int l, int r) {
		l += n, r += n;
		T ans = neut;
		while (l <= r) {
			if (l & 1) ans = merge(ans, tree[l++]);
			if (!(r & 1)) ans = merge(ans, tree[r--]);
			l >>= 1, r >>= 1;
		}
		return ans;
	}
};

template <class T> struct Stree2 {
	int n; T neut = 1e9;
	vector <T> tree;
	Stree2(int n) : n(n) { tree.assign((n + 1) << 1, neut); }
	T merge(T &a, T &b) { return min(a, b); }
	void update(int k, T x) {
		k += n;
		tree[k] = merge(tree[k], x);
		for (k >>= 1; k; k >>= 1) tree[k] = merge(tree[k << 1], tree[k << 1 | 1]);
	}
	T query(int l, int r) {
		l += n, r += n;
		T ans = neut;
		while (l <= r) {
			if (l & 1) ans = merge(ans, tree[l++]);
			if (!(r & 1)) ans = merge(ans, tree[r--]);
			l >>= 1, r >>= 1;
		}
		return ans;
	}
};

struct Fen{
	int n;
	vector<long long> tree;
	Fen(int n): n(n){
		tree.assign(n+10,0);
	}
	void upd(int i, int v){
		while(i<=n){
			tree[i] += v;
			i += i&-i;
		}
	}
	long long get(int i){
		long long ans = 0;
		while(i>=1){
			ans += tree[i];
			i -= i&-i;
		}
		return ans;
	}
	long long get(int l, int r){
		return get(r) - get(l-1);
	}
};



int main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n;
	cin>>n;
	map<pair<int,int>,int> idx;
	vector<int> a(2*n);
	vector<int> cop(2*n+10);
	for(int i=0; i<n; i++){
		int l, r;
		cin>>l>>r;
		idx[make_pair(l,r)] = i;
		a[2*i] = l;
		a[2*i+1] = r;
		cop[l] = r;
		cop[r] = l;
	}
	sort(a.begin(),a.end());
	vector<long long> ans(n);
	Fen cnt(2*n+10);
	for(int i=0; i<int(a.size()); i++){
		int l = a[i];
		int r = cop[a[i]];
		if(l < r){
			int ix = idx[make_pair(l,r)];
			ans[ix] += cnt.get(r+1,2*n+2);
		}
		cnt.upd(r,1);
	}
	debug(ans);
	vector<long long> betw(2*n);
	for(int i=0; i<2*n; i++){
		int l = a[i];
		int r = cop[a[i]];
		if(l < r){
			betw[i] = 1;;
		}
		if(i) betw[i] += betw[i-1];
	}
	for(int i=0; i<2*n; i++){
		int l = a[i];
		int r = cop[a[i]];
		if(l < r){
			int j = lower_bound(a.begin(),a.end(),r) - a.begin();
			int ix = idx[make_pair(l,r)];
			ans[ix] += betw[j] - betw[i];
		}
	}
	Stree<int> mx(2*n);
	for(int i=0; i<2*n; i++){
		int l = a[i];
		int r = cop[a[i]];
		if(l < r){
			mx.update(i,r);
		}
	}
	vector<pair<long long,long long>> dp(2*n,make_pair(-1,-1));
	function<pair<long long,long long>(int)> go = [&](int i){
		pair<long long, long long>& ans = dp[i];
		if(ans != make_pair(-1ll,-1ll)) return ans;
		int l = 0;
		int r = i;
		int nxtv = mx.query(l,r);
		int j = lower_bound(a.begin(),a.end(),nxtv)-a.begin();
		if( j == r ){
			return ans = make_pair(0,0);
		}else{
			long long add = betw[j] - (i-1>=0?betw[i-1] : 0);
			ans = make_pair(go(j).first + add, go(j).second);
			ans.second += ans.first;
		}
		return ans;
	};
	debug(ans);
	debug(betw);
	for(int i=0; i<2*n; i++){
		int l = a[i];
		int r = cop[a[i]];
		if( l > r){
			swap(l,r);
			int ix = idx[make_pair(l,r)];
			ans[ix]  += go(i).second + go(i).first;
		}
	}
	debug(ans);
	Stree2<int> mn(2*n);
	for(int i=0; i<2*n; i++){
		int r = a[i];
		int l = cop[a[i]];
		if(r > l){
			mn.update(i,l);
		}
	}
	for(int i=0; i<2*n; i++){
		betw[i] = 0;
		int l = a[i];
		int r = cop[a[i]];
		if(!(l < r)){
			betw[i] = 1;;
		}
		if(i) betw[i] += betw[i-1];
	}
	vector<pair<long long, long long>> dp2(2*n, make_pair(-1,-1));
	function<pair<long long, long long>(int)> go2 = [&](int i){
		pair<long long, long long>& ans = dp2[i];
		if(ans != make_pair(-1ll,-1ll)) return ans;
		int l = i;
		int r = 2*n;
		int nxtv = mn.query(i,r);
		int j = lower_bound(a.begin(),a.end(),nxtv)-a.begin();
		if(j == l){
			return ans = make_pair(0,0);
		}else{
			long long add = betw[i] - (j-1>=0 ? betw[j-1] : 0);
			ans = make_pair(go2(j).first + add, go2(j).second);
			ans.second += ans.first;
		}
		return ans;
	};
	debug(ans);
	for(int i=0; i<2*n; i++){
		int l = a[i];
		int r = cop[a[i]];
		if(l < r){
			int ix = idx[make_pair(l,r)];
			ans[ix] += go2(i).second + go2(i).first;
		}
	}
	debug(ans);
	Fen fk(2*n);
	for(int i = 2*n-1; i>=0; i--){
		int l = a[i];
		int r = cop[a[i]];
		if( l < r){
			int ix = idx[make_pair(l,r)];
			ans[ix] += fk.get(0,l-1);
		}else{
			swap(l,r);
			int ix = idx[make_pair(l,r)];
			ans[ix] -= fk.get(0,l-1);
			fk.upd(l,1);
		}
	}
	for(auto& i : ans){
		cout<<i<<' ';
	}
	cout<<'\n';
	return 0;
}