#include <stdio.h>;
int Ind[300001];

int find(int p) {
	while (p != Ind[p])
		p = Ind[p];
	return p;
}
void Union(int p, int q) {
	int r1 = find(p);
	int r2 = find(q);
	Ind[r1] = r2;
}

void main() {
	int N, a, b;
	scanf("%d", &N);
	for (int i = 1; i <= N; i++)
	{
		Ind[i] = i;
	}
	if (N == 2)
	{
		printf("1 2");
	}
	else {
		for (int i = 0; i < N-2; i++)
		{
			scanf("%d %d", &a, &b);
			Union(a, b);
		}
		int root = find(1);
		for (int i = 2; i <= N + 1; i++)
		{
			if (Ind[i] != root)
			{
				printf("%d %d", root, i);
				break;
			}
		}
	}
	exit(0);
}