#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using ll = long long;
#define pb push_back
#define F first
#define S second
#define vii vector<int>
#define vl vector<long long>
#define cinv(v) for (auto &it : v) cin >> it;
#define coutv(v) for (auto &it : v) cout << it << " "; cout << '\n';
#define dbg_var(x,y) cout<<y<<"# Debugging: "<<x<<'\n';
using namespace std;
//using namespace __gnu_pbds;
//template<class T> using ordset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
void solve()
{
int n;
cin>>n;
vector<int> a;
while(n--)
{
int p,v;
cin>>p>>v;
a.insert(a.begin()+(--p),v);
vector<int> dp(a.size(),1);
int ans = 1;
for(int i=1;i<a.size();++i)
{
for(int j=0;j<i;++j)
{
if(a[j] < a[i])
{
dp[i] = max(dp[i],dp[j]+1);
ans = max(ans,dp[i]);
}
}
}
cout<<ans<<'\n';
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
//int t;cin>>t;while(t--)
solve();
return 0;
}
