#include<iostream>
#include<cstring>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n;
    cin >> n;
    vector<int> ans(n - 1);
    vector<pair<int, int > > p(n);
    for(int i = 0; i < n; i++){
        cin >> p[i].first >> p[i].second;
    }
    sort(p.begin(), p.end(), [&](pair<int, int> a, pair<int, int> b){
        if (a.first != b.first) return a.first < b.first;
        return a.second > b.second;
    });

    set<pair<int, int> > sa, sb;

    auto get = [&](){
        int ans = -2e9;
        {
            int t = prev(sa.end())->first;
            if (prev(sa.end())->second == prev(sb.end())->second){
                t -= prev(sb.end(), 2)->first;
            }
            else{
                t -= prev(sb.end())->first;
            }
            ans = max(ans, t);
        }
        {
            int t = p[prev(sb.end())->second].first;
            t -= prev(sb.end(), 2)->first;
            ans = max(ans, t);
        }
        return ans;
    };

    sa.insert({p[0].first, 0});
    sb.insert({p[0].second, 0});
    for(int i = 1; i < n; i++){
        sa.insert({p[i].first, i});
        sb.insert({p[i].second, i});
        ans[n - 1 - i] = get();
    }
    for(int i = 1; i <= n - 2; i++) ans[i] = min(ans[i], ans[i - 1]);
    for(auto x : ans) cout << x << '\n';    

}