#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;

const int maxn = 5000 + 10;
int n, cnt = 0;
int g[maxn][maxn];

struct node
{
	int u;
	int v;
}r[maxn];

int main()
{
	freopen("hopetree.in","r",stdin);
	freopen("hopetree.out","w",stdout);
	memset(g,0,sizeof(g));
	cin >> n;
	for (int i = 1; i <= n-1; i++)
	{
		cin >> r[i].u >> r[i].v;
		g[r[i].u][r[i].v] = 1;
		g[r[i].v][r[i].u] = 1;
	}
	cnt = 5;
	int ans1, ans2;
	ans1 = cnt % 338 + 1;
	ans2 = (cnt + 233) % 338 + 1;
	cout << ans1 << " " << ans2;
	return 0;
}