#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
const int64_t INF = 1ll << 60;
const int N = 1e6 + 6;
const int SQ = 1000;
const int SQQ = 2000 + 5;
int n, x[N], p[N], a[N], S, q, ans[N], mx;
vector<int> V[SQQ];
pair<int, int> M[SQQ];
void rebuild() {
vector<int> x;
for (int i = 0; V[i].size(); i++) {
for (auto u: V[i]) x.push_back(u);
V[i].clear();
}
mx = 0;
FOR(i, 0, x.size()) {
V[i / SQ].push_back(x[i]);
mx = max(mx, (int) V[i / SQ].size());
}
}
inline void add(vector<int> &v, int pos, int x) {
if (pos == v.size()) {
v.push_back(x);
return;
}
v.insert(v.begin() + pos, x);
mx = max(mx, (int) v.size());
}
void seq() {
FOR(i, 0, q) {
if (mx >= SQ) rebuild();
int cur = p[i] - 1;
for (int j = 0; j <= i; j++) {
if (cur > V[j].size()) cur -= V[j].size();
else {
add(V[j], cur, i);
cur = 0;
break;
}
}
}
int ptr = 0;
for (int i = 0; V[i].size(); i++) for (auto u: V[i]) a[ptr++] = u;
}
void solve() {
while (true) {
pair<int, int> lis = {0, INF};
fill(M, M + SQQ, lis);
FOR(i, 0, q) {
pair<int, int> p = {0, INF};
FOR(j, 0, x[a[i]]) p = max(p, M[j]);
p.first++;
p.second = min(p.second, -a[i]);
M[x[a[i]]] = max(M[x[a[i]]], p);
}
lis = *max_element(M, M + SQQ);
for (int i = q - 1; i >= -lis.second; i--) ans[i] = lis.first;
if (lis.second == 0) return;
vector<int> v;
FOR(i, 0, q) if (a[i] < -lis.second) v.push_back(a[i]);
q = v.size();
copy(v.begin(), v.end(), a);
}
}
signed main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> q;
int tq = q;
vector<int> X;
FOR(i, 0, q) {
cin >> p[i] >> x[i];
X.push_back(x[i]);
}
sort(X.begin(), X.end());
X.resize(unique(X.begin(), X.end()) - X.begin());
FOR(i, 0, q) {
x[i] = lower_bound(X.begin(), X.end(), x[i]) - X.begin() + 1;
}
assert(X.size() <= SQQ);
seq();
solve();
FOR(i, 0, tq) cout << ans[i] << '\n';
}
//12:54:46
