#include<cstdio>
#include<cstring>
#include<algorithm>
#define inf (int)1e9
using namespace std;
const int maxn=5010;
int n,dis[maxn][maxn];
void Floyed(){
	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);
	scanf("%d",&n);
	int u,v,cnt=0;
	for(int i=1;i<=n;i++)
		for(int j=i+1;j<=n;j++)dis[i][j]=dis[j][i]=inf;
	for(int i=1;i<n;i++)scanf("%d%d",&u,&v),dis[u][v]=dis[v][u]=1;
	Floyed();
	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[i][k]&&dis[j][k]==dis[i][j])cnt++;
			}
		}
	}
	printf("%d %d",(cnt%338)+1,(cnt+233)%338+1);
	return 0;
}