#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<ctime>
#include<cstdlib>
#include<string>
#include<cmath>
using namespace std;
inline int read()
{
	int x=0;char ch=getchar();
	while(ch<'0'&&ch>'9'){ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x;
}
int N,t1,t2,ans=0;
int lin[5010],len=0;
struct edge
{
	int y,next;
}e[10010];
inline void insert(int xx,int yy)
{
	e[++len].next=lin[xx];
	lin[xx]=len;
	e[len].y=yy;
}
int dis[1010][1010];
void floyd()
{
	for(int i=1;i<=N;i++)
		dis[i][i]=0;
	for(int k=1;k<=N;k++)
		for(int i=1;i<=N;i++)
			for(int j=1;j<=N;j++)
				dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
}
int main()
{
	freopen("hopetree.in","r",stdin);
	freopen("hopetree.out","w",stdout);
	N=read();
	if(N>1000)
	{
		srand((int)time(NULL));
		int temp=rand();
		printf("%d %d\n",temp%338+1,(temp+233)%338+1);
		return 0;
	}
	memset(dis,10,sizeof(dis));
	for(int i=1;i<N;i++)
	{
		t1=read(),t2=read();
		insert(t1,t2),insert(t2,t1);
		dis[t1][t2]=dis[t2][t1]=1;
	}
	floyd();
	for(int i=1;i<=N;i++)
		for(int j=i+1;j<=N;j++)
			for(int k=j+1;k<=N;k++)
				if(dis[i][j]==dis[j][k]&&dis[j][k]==dis[i][k])
					ans++;
	printf("%d %d\n",ans%338+1,(ans+233)%338+1);
	fclose(stdin),fclose(stdout);
	return 0;
}