#include<bits/stdc++.h>
using namespace std;
#define rep2(i,j,k) for(ll i=ll(j); i<ll(k); i++)
#define rep(i,j) rep2(i,0,j)
#define rrep2(i,j,k) for(ll i=ll(j)-1;i>=ll(k);i--)
#define rrep(i,j) rrep2(i,j,0)
#define SZ(a) ll(a.size())
#define all(a) a.begin(),a.end()
#define eb emplace_back
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vl>;
using P=pair<ll,ll>;
using vp=vector<P>;
using vvp=vector<vp>;
const ll inf=LLONG_MAX/4;
template<typename T>
bool chmin(T& a,T b){return a>b?a=b,1:0;}
template<typename T>
bool chmax(T& a,T b){return a<b?a=b,1:0;}

const int C = 600010;
const int B = 800;

int cnt[C], to[C];
int seg[C];

int main(){
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin >> n;
	rep(i, C) seg[i] = -1;
	set<P> st;
	auto upd = [&](int b) {
		int l = B * b;
		int r = min(B * (b+1), C);
		rrep2(i, r, l) {
			if(seg[i] == -1) {
				if(i+1 == r) {
					cnt[i] = 0;
					to[i] = r;
				} else {
					cnt[i] = cnt[i+1];
					to[i] = to[i+1];
				}
			} else {
				if(seg[i] < r) {
					cnt[i] = cnt[seg[i]]+1;
					to[i] = to[seg[i]];
				} else {
					cnt[i] = 1;
					to[i] = seg[i];
				}
			}
		}
	};
	auto get_ans = [&]() -> int {
		int now = 0, ans = 0;
		while(now < C) {
			ans += cnt[now];
			now = to[now];
		}
		return ans;
	};
	auto add = [&](int l, int r) {
		assert(seg[l] == -1);
		seg[l] = r;
		upd(l/B);
	};
	auto del = [&](int l, int r) {
		assert(seg[l] == r);
		seg[l] = -1;
		upd(l/B);
	};
	rep(i, C/B+1) upd(i);
	while(n--) {
		int l, r;
		cin >> l >> r;
		--l;
		auto it = st.lower_bound(P{l, l});
		if(it == st.end() or it->second > r) {
			if(it != st.end() and it->first == l) {
				del(it->first, it->second);
				st.erase(it);
			}
			add(l, r);
			st.insert(P{l, r});
			it = st.lower_bound(P{l, r});
			while(it != st.begin() and prev(it)->second >= r) {
				--it;
				del(it->first, it->second);
				it = st.erase(it);
			}
		}
		cout << get_ans() << '\n';
	}
}