#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
const int maxn=5010;
int f[5010][5010];
int g[5010][5010];
vector<int>A[5010];
int vis[5010];
int now=0;
long long ans=0;
int n;
int dfn[maxn],size[maxn];
int ti=0;
inline void dfs(int x,int d){
	f[now][x]=d;
	vis[x]=1;
	for(int i=0;i<A[x].size();i++){
		int u=A[x][i];
		if(vis[u])
			continue;
		dfs(u,d+1);
	}
}
/*inline void pre_do(int x,int fa){
	size[x]=1;
	dfn[x]=++ti;
	for(int i=0;i<A[x].size();i++){
		int u=A[x][i];
		if(u==fa)
			continue;
		dfs(u,x);
		size[x]+=size[u];
	}
}
inline void work(int x,int fa){
	for(int i=1;i<=5000;i++){
		if(f[x][i]<3)
			continue;
		int ff=f[x][i],gg=g[x][i];
		if(ff>=2&&gg)
			ans+=(long long)gg*(long long)ff*(ff-1)/2;
		if(gg>=2&&ff)
			ans+=(long long)ff*(long long)gg*(gg-1)/2;
	}
	for(int i=0;i<A[x].size();i++){
		int u=A[x][i];
		if(u==fa)
			continue ;
		work(u,x);
	}
}*/
int main(){
	freopen("hopetree.in","r",stdin);
	freopen("hopetree.out","w",stdout);
	scanf("%d",&n);
	int x,y;
	for(int i=1;i<n;i++){
		scanf("%d %d",&x,&y);
		A[x].push_back(y);
		A[y].push_back(x);
	}
	for(int i=1;i<=n;i++){
		memset(vis,0,sizeof(vis));
		now=i;
		dfs(i,0);
	}
	for(int i=1;i<=n;i++)
		for(int j=i+1;j<=n;j++)
			for(int k=j+1;k<=n;k++)
				if(f[i][j]==f[j][k]&&f[i][j]==f[i][k]&&f[i][k]==f[j][k])
					ans++;
	cout<<ans%388+1<<' '<<(ans+233)%388+1<<endl;
	/*for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++)
			printf("%d ",f[i][j]);
		puts("");
	}*/
return 0;
}