#include <iostream>
#include <cstdio>
#include <queue>
#include <math.h>
#include <map>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef long long ll;
const int maxn = 5e6 + 7;
int n , q , a[maxn];

int main() {
    scanf("%d",&n);
    int now = 1;
    for(int i = 1; i <= n; i ++){
        int op , pos;
        scanf("%d%d",&op,&pos);
        if(op == 1){
            a[pos] = 1;
            while(a[now] == 1) now++;
        }
        else{
            int ans = now;
            int x = a[pos];
            a[pos] = 1;
            while(a[ans] == 1) ans ++;
            a[pos] = x;
            printf ("%d\n",ans);
        }
    }


    return 0;
}