#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

//#include <atcoder/convolution>
//#include <atcoder/modint> 
//using Modint = atcoder::modint998244353;

using namespace std;
typedef long long ll;

void ex_gcd(ll a, ll b, ll &d, ll &x, ll &y) {
  if (!b) {
    d = a;
    x = 1;
    y = 0;
  } else {
    ex_gcd(b, a % b, d, y, x);
    y -= a / b * x;
  }
}
ll inv(ll a, ll n) {
  ll d, x, y;
  ex_gcd(a, n, d, x, y);
  return d == 1 ? (x % n + n) % (n / d) : -1;
}
ll gcd(ll x, ll y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}

int gcd(int x, int y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}

const int maxn = 5000005;
const int mod = 998244353;

bool a[maxn];


inline void scan_d(int &ret) {
    char c; ret=0;
    while((c=getchar())<'0'||c>'9');
    while(c>='0'&&c<='9') ret=ret*10+(c-'0'),c=getchar();
}

int main() {
#ifdef suiyuan2009
  freopen("/Users/suiyuan2009/CLionProjects/icpc/input.cpp", "r", stdin);
  freopen("/Users/suiyuan2009/CLionProjects/icpc/output.cpp", "w", stdout);
#endif
  int n;
  cin>>n;
  int l = 1, r = 2;
  int t,x;
  for(int i=1;i<=n;i++){
    scan_d(t);
    scan_d(x);
    if(t==1){
      if(x<l||(x>l&&x<r)||a[x])continue;
      if(x>r){
        a[x] = 1;
      } else if(x==l){
        a[x] = 1;
        l = r;
        r++;
        while(a[r])r++;
      } else if(x==r) {
        a[x] = 1;
        r++;
        while(a[r])r++;
      }
    } else {
      if(x==l)printf("%d\n", r);
      else printf("%d\n",l);
    }
  }
  return 0;
}