#include<bits/stdc++.h>
#define LL long long

using namespace std;
const int N = 2e3 + 5;
struct node{
	int s,e;
}a[N];
bool cmp(node a,node b){
	return a.s < b.s;
}
int n,t;
int dp[N];
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(nullptr);
	cin >> n;
	for(int i = 1;i <= n;++i){
		cin >> a[i].s >> a[i].e;
	}
	dp[1] = a[1].e - a[1].s + 1;
	t = a[1].e;
	sort(a + 1,a + n + 1,cmp);
	for(int i = 1;i <= n;++i){
		cout << a[i].s << ' ' << a[i].e << endl;
	}
	cout << endl << endl;
	for(int i = 2;i <= n;++i){
		if(a[i].s <= t){
			dp[i] = max(dp[i - 1],a[i].e - a[i].s + 1);
			if(dp[i - 1] < a[i].e - a[i].s + 1){
				t = a[i].e;
			}
		}
		if(a[i].s > t){
			dp[i] = dp[i - 1] + a[i].e - a[i].s + 1;
			t = a[i].e;
		}
		cout << dp[i] << ' ';
	}
	cout << dp[n];
	return 0;
}