#include<algorithm>
#include<vector>
#include<string>
using namespace std;
#define N_MAX 100002
string a[N_MAX],A[N_MAX];
char c[N_MAX];
int n,i,j,t,k;
int N,nf,Nf;
int intr[N_MAX],ut[N_MAX];
int aib[N_MAX];

inline int LSB(int i)
{
	return i&(-i);
}

void update(int ind,int val)
{
	for(int i=ind;i<=Nf;i+=LSB(i))
		aib[i]+=val;
}

int query(int sum)
{
	int i,step;
	for(step=1;step<Nf;step<<=1);
	for(i=0;step;step>>=1)
		if(i+step<=Nf&&aib[i+step]<sum)
		{
			i+=step;
			sum-=aib[i];
			if(!sum)
				return i;
		}
	return i+1;
	return -1;
}

struct cmp
{
	bool operator () (string a,string b) const
	{
		int la=a.size();
		int lb=b.size();
		return la<lb||la==lb&&a.compare(b)<0;
	}
};

int main()
{
	freopen("nums.in","r",stdin);
	freopen("nums.out","w",stdout);

	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%d",&t);
		if(t)
		{
			scanf("%s",c);
			a[++N]=c;
		}
		else
		{
			scanf("%d",&k);
			intr[i]=k;
		}
	}

	for(i=1;i<=N;i++)
		A[i]=a[i];
	sort(A+1,A+N+1,cmp());
	
	for(i=1;i<=N;)
	{
		for(j=i;j<=N;j++)
			if(A[i]!=A[j])
				break;
		A[++Nf]=A[i];
		i=j;
	}

	for(i=1;i<=n;i++)
	{
		nf+=intr[i]==0;
		if(intr[i])
		{
			j=query(intr[i]);
			printf("%s\n",A[j].c_str());
		}
		else
		{
			int ind=lower_bound(A+1,A+Nf+1,a[nf],cmp())-A;
			if(ut[ind]==1)
				continue;
			ut[ind]=1;
			update(ind,1);
		}
	}

	return 0;
}