#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<cstring>
#include<string>
#include<cstdlib>
using namespace std;
int a[5010];
int main()
{
		freopen("hopetree.in","r",stdin);
	freopen("hopetree.out","w",stdout);
	long long ans=0;
	int n,k1,k2;
	cin>>n;
	for(int i=1;i<=n-1;i++)
	{
		cin>>k1>>k2;
		a[k1]++;
		a[k2]++;
	}
	for(int i=1;i<=n;i++)
	{
		//cout<<a[i]<<endl;
		if(a[i]==3) ans++;
		//cout<<ans<<endl;
		if(a[i]>3){
			long long an=1;
			for(int j=1;j<=a[i];j++)
			{
				an=an*j;
			}
			for(int j=1;j<=a[i]-3;j++)
			{
				an=an/j;
			}
			an=an/6;
			ans=ans+an;
		}
		
	}
	cout<<ans%338+1<<" "<<(ans+233)%338+1;
	return 0;
}