#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;
#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()
cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;
template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;
cl N = 1e6 + 7;
ll P [N], X [N], a [N], b [N], lis [N], n, ans;
set <ll> pos [N], dpos [N];
struct fenwick {
ll fen [N];
inline fenwick () { for (ll i = 1; i < N; i++) add(i, 1); }
inline void add (ll i, cl &x) { for (; i < N; i += i & -i) fen[i] += x; }
inline ll kth (ll x) {
ll ret = 0;
for (ll i = 20; i--;) if (ret + (1 << i) < N && fen[ret + (1 << i)] < x) ret += 1 << i, x -= fen[ret];
add(ret + 1, -1); return ret + 1;
}
} fen;
void upd (cl &i) {
ans = max(ans, lis[i]);
for (auto it = dpos[lis[i]].lower_bound(a[i]); it != dpos[lis[i]].end() && X[i] < X[b[*it]];) {
lis[b[*it]]++; upd(b[*it]);
dpos[lis[i] + 1].insert(*it); it++;
dpos[lis[i]].erase(prev(it));
}
}
int main ()
{
cin.tie(0)->sync_with_stdio(false);
cin>> n;
for (ll i = 1; i <= n; i++) cin>> P[i] >> X[i];
for (ll i = n; i; i--) b[a[i] = fen.kth(P[i])] = i;
for (ll i = 1; i <= n; i++) {
for (ll j = X[i]; --j;) {
auto it = pos[j].lower_bound(a[i]);
if (it != pos[j].begin()) lis[i] = max(lis[i], lis[b[*prev(it)]]);
}
lis[i]++;
upd(i);
pos[X[i]].insert(a[i]);
dpos[lis[i]].insert(a[i]);
cout<< ans << '\n';
}
cerr<< "\n" __TIMESTAMP__ " - Time elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
/*
6
1 7
2 10
2 11
2 8
4 10
1 2
4
1 3
2 1
1 1
2 2
*/
