#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=200005;
int n;
map<int,pair<int,int> > nums;//first + second -
int ans[100005];
int k[1000005];
void solve(){
	cin>>n;
	for(int i=1,l,r;i<=n;i++){
		cin>>l>>r;
		nums[l].first++;
		nums[r].second--;
	}
	int pre=0,now=0;
	for(auto it:nums){
		if(it.second.first>0){
			now=pre+it.second.first;
			k[now]++;
			k[pre]+=(it.second.first-1)*(it.second.first)/2;
			ans[pre]+=it.second.first;
		}
		pre=now+it.second.second;
	}
	ans[n+1]=0;
	for(int i=n;i>=1;i--){
		ans[i]+=ans[i+1];
	}
	for(int i=1;i<=n;i++){
		if(i==1)cout<<ans[i]*i+k[i];
		else cout<<" "<<ans[i]*i+k[i];
	}
	return;
}
signed main() {
	//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	int t=1;
//	cin>>t;
	while(t--){
		solve();
	}
    return 0;
}