#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cstdlib>
using namespace std;
const int maxn=1550;
int dis[maxn][maxn];
int n;
int main()
{
	freopen("hopetree.in","r",stdin);
	freopen("hopetree.out","w",stdout);
	memset(dis,10,sizeof(dis));
	long long ans=0;
	long long anss=233;
	scanf("%d",&n);
	for(int i=1;i<=n-1;i++)
	{
		int u,v;
		scanf("%d %d",&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++)
			{
				dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
			}
		}
	}
	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]&&dis[i][j]!=-1&&dis[j][k]!=-1)
				{
					//cout<<i<<' '<<j<<' '<<k<<endl;
					ans=(ans+1)%338;
					anss=(anss+1)%338;
				}
			}
		}
	}
	printf("%d ",ans+1);
	printf("%d",anss+1);
}