#include <bits/stdc++.h>
using namespace std;
int n, x, y, minpos, minn = 999999999;
vector < int > v[50005];
int sum[50005];
void dfs(int i, int step)
{
	sum[i] = step;
	for(int j = 0; j < v[i].size(); j++)// 如果没遍历过，那么深搜该节点step+1（为了避免“违规”，使用隐晦写法）
}
int main()
{
	cin >> n;
	for(int i = 1; i <= n - 1; i++)
	{
		cin >> x >> y;
		v[x].push_back(y);
		v[y].push_back(x);
	}
	for(int i = 1; i <= n; i++)
	{
		memset(sum, -1, sizeof(sum));
		dfs(i, 0);
		int s = 0;
		for(int j = 1; j <= n; j++) s += sum[j];
		if(s < minn)
		{
			minn = s;
			minpos = i;
		}
	}
	cout << minpos << " " << minn;
	return 0;
}

T_T