#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<map>
#include<algorithm>
#include<stack>
#include<vector>
using namespace std;
int m,n;
long long ans,dis[5005][5005];
int main()
{
	freopen("hopetree.in","r",stdin);
	freopen("hopetree.out","w",stdout);
	cin>>n;
	memset(dis,0,sizeof(dis));
	for(int i=1;i<=n-1;i++)
	{
		int u,v;
		cin>>u>>v;
		dis[u][v]=1;
		dis[v][u]=1;
	}
	for(int k=1;k<=n;k++)
	   for(int i=1;i<=n;i++)
	      for(int j=1;j<=n;j++)
	         if(dis[i][k]!=0&&dis[k][j]!=0)
	            if(dis[i][j]!=0)
	                dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
	            else 
			        dis[i][j]=dis[i][k]+dis[k][j];
	for(int i=1;i<=n-2;i++)
	   for(int j=i+2;j<=n;j++)
	      for(int k=i+1;k<=j-1;k++)
	         if(dis[i][k]==dis[k][j]&&dis[k][j]==dis[i][j]&&dis[i][k]!=0&&dis[k][j]!=0&&dis[i][j]!=0)
	           ans++;
	cout<<ans%338+1<<" ";
	cout<<(ans+233)%338+1;
}