#include<stdio.h>
int p[102], cnt[102];
int root(int n)
{
	if (n != p[n])
		p[n] = root(p[n]);
	return p[n];
}
void uni(int x, int y)
{
	x = root(x);
	y = root(y);
	if (x != y)
		cnt[x] += cnt[y];
	p[y] = x;
	return;
}
int main()
{
	int n;
	scanf("%d", &n);
	int i;
	for (i = 0; i < n; i++)
	{
		p[i] = i;
		cnt[i] = 1;
	}
	int a, b;
	char c[102];
	for (;;)
	{
		scanf("%d %d %s", &a, &b, c);
		uni(a - 1, b - 1);
		if (cnt[root(a - 1)] == n)
		{
			printf("%s\n", c);
			break;
		}
	}
	return 0;
}