#include<bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const int maxn = 5e6 + 70;
const int INF = 0x3f3f3f3f;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;
const double eps = 1e-7;
const double PI = acos(-1.0);

int n, m, k;

bool vis[maxn];

int f[maxn];

int find(int x) { return f[x] == x ? x : f[x] = find(f[x]); }

int main(){
    //freopen("in.txt", "r", stdin);
    while(cin>>n){
        memset(vis+1, 0, n);
        for(int i=1;i<=n+1;i++) f[i] = i;

        for(int i=1;i<=n;i++){
            int o, x; scanf("%d %d",&o,&x);
            if(o == 1) {
                if(!vis[x]){
                    f[x] = find(x + 1);
                    vis[x] = 1;
                }
            }
            else{
                int y = find(1);
                if(y == x) y = find(y + 1);
                printf("%d\n",y);
            }
        }
    }
    return 0;
}