Program nums;
var K,i,C,X,N:longint;
	A:array[1..100000] of longint;
	t:longint;
	FI,FO:Text;

Procedure Bouble(nr:longint);
	var X,i,O,Q:longint;
	begin
	For O:=K-1 DownTo 1 Do
		For i:=1 to O do
			IF A[i]>A[i+1] then
				Begin
				X:=A[i];
				A[i]:=A[i+1];
				A[i+1]:=X;
				end;
        For i:=1 to K do
            IF A[i]=0 then
               For Q:=i to j-1 do
                   A[Q]:=A[Q+1];

	Writeln(FO,A[nr]);
	End;

Function vrf(nr:longint):boolean;
	var i:longint;
		ok:boolean;
	Begin
	ok:=true;
	for i:=1 to j do
		if A[i]=nr then ok:=false;
	vrf:=ok;
	end;


Begin
K:=1;
Assign(FI,'nums.in');
Reset(FI);
ASSIGN(FO,'nums.out');
Rewrite(FO);
Readln(FI,n);
	For i:=1 to n do
		begin
		Readln(FI,T,X);
		IF T=1 then { daca T=1 adaugam}
			IF vrf(X) then { verificam daca mai exista acest numar in vector}
				Begin
				A[K]:=X;
				inc(K);
				end;
		IF (T=0) and (X<=k) then
			bouble(X);
		end;
Close(FI);
Close(FO);


end.