#include<fstream>
#include<algorithm>
using namespace std;
const int nmax=100005;
struct numar
{
    string str;
    int ind;
}v[nmax];
string s[nmax];
int aib[nmax],poz[nmax],stat[nmax],first[nmax];
int i,n,m,p,u,idx,k,sum,key,tip,j;
bool ap[nmax];
bool comp(const numar &unu,const numar &doi)
{
     if(unu.str.size()==doi.str.size()) return unu.str<doi.str;
    return (unu.str.size()<doi.str.size());
}
inline int lbit(int x)
{
    return ((x^(x-1))&x);
}
void update()
{
    for(idx=poz[i];idx<=key;idx+=lbit(idx))
      aib[idx]++;
}
int compute(int pozitie)
{
    sum=0;
    for(idx=pozitie;idx>0;idx-=lbit(idx))
        sum+=aib[idx];
    return sum;
}
int cb()
{
    p=1;u=key;
    while(u-p>1)
    {
        m=(p+u)/2;
        if(compute(m)<stat[i]) p=m;
        else u=m;
    }
    if(compute(u-1)==stat[i]) u--;
    return u;
}
void norm()
{
    for(i=1;i<=k;i++)
    {
        if(v[i].str!=v[i-1].str)
            {key++;first[key]=i;}
        poz[v[i].ind]=key;
    }
}
int main()
{
    ifstream f("nums.in");
    ofstream g("nums.out");
    f>>n;
    for(i=1;i<=n;i++)
    {
        f>>tip;
        if(tip==1)
        {
            f>>s[i];
            k++;
            v[k].str=s[i];
            v[k].ind=i;
        }else
        {
            f>>stat[i];
        }
    }
    sort(v+1,v+k+1,comp);
    norm();
    for(i=1;i<=n;i++)
    {
        if(stat[i]!=0)
        {
            g<<v[first[cb()]].str<<'\n';
        }
        else
        {
            if(!ap[poz[i]])update();
            ap[poz[i]]=1;
        }
    }
    return 0;
}