#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N = 5000010;

int a[N], c[N];

void add(int x, int v) {
    for(int i=x; i<N; i+=i&(-i))
        c[i] += v;
}

int ask(int x) {
    int res = 0;
    for(int i=x; i; i-=i&(-i))
        res += c[i];
    return res;
}

int query() {
    int res = 0, pos = 0;
    for(int j=25; j>=0; j--) {
        pos += 1<<j;
        if(pos>=N || c[pos]!=(1<<j))
            pos -= 1<<j;
        else
            continue;
    }
    return pos;
}

int main() {
    int n;
    scanf("%d", &n);
    for(int t=1; t<=n; t++) {
        int k, x;
        scanf("%d%d", &k, &x);
        if(k==1) {
            if(a[x]==0) {
                add(x, 1);
                a[x] = 1;
            }
        }
        else {
            int ans = 0;
            if(a[x]) {
                ans = query();
            }
            else {
                add(x, 1);
                ans = query();
                add(x, -1);
            }
            printf("%d\n", ans+1);
        }
    }
    return 0;
}