#include<bits/stdc++.h>
using namespace std;
inline int read()
{
	int f=1,num=0;
	char c=getchar();
	while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
	while(c>='0'&&c<='9') num=num*10+c-'0',c=getchar();
	return num*f;
}
const int N=1000010,INF=0x3f3f3f3f;
int n;
int t,x,y;
int xxx;
struct Seg
{
	int tag,val;
}a[4*N];
void build(int l,int r,int p)
{
	a[p]=(Seg){0,INF};
	if(l==r)
	{
		if(l==1) a[p].val=0;
		return;
	}
	int mid=(l+r)/2;
	build(l,mid,p*2);
	build(mid+1,r,p*2+1);
	return;
}
void push_down(int p)
{
	a[p*2].val+=a[p].tag;a[p*2].tag+=a[p].tag;
	a[p*2+1].val+=a[p].tag;a[p*2+1].tag+=a[p].tag;
	a[p].tag=0;
	return;
}
void change(int w,int z,int l,int r,int p)
{
	if(l==w&&w==r)
	{
		a[p].val=z;
		return;
	}
	push_down(p);
	int mid=(l+r)/2;
	if(w<=mid) change(w,z,l,mid,p*2);
	else change(w,z,mid+1,r,p*2+1);
	return;
}
int q(int w,int l,int r,int p)
{
	if(l==w&&w==r) return a[p].val;
	push_down(p);
	int mid=(l+r)/2;
	if(w<=mid) return q(w,l,mid,p*2);
	return q(w,mid+1,r,p*2+1);
}
int main()
{
	freopen("flurryofblows.in","r",stdin);
	freopen("flurryofblows.out","w",stdout);
	n=read();
	build(1,n,1);
	for(int i=1;i<=n;i++)
	{
		t=read();
		if(t==1)
		{
			x=read();
			a[1].tag++;
			change(x,0,1,n,1);
		}
		else
		{
			x=read();y=read();
			if(x==y) continue;
			xxx=q(x,1,n,1);
			change(y,min(xxx,q(y,1,n,1)),1,n,1);
			change(x,xxx+1,1,n,1);
		}
	}
	for(int i=1;i<=n;i++)
	{
		xxx=q(i,1,n,1);
		if(xxx>=INF) printf("-1 ");
		else printf("%d ",xxx);
	}
	return 0;
}