#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<map>
using namespace std;
int m,n,k,u,v,s,t=0;
vector<int>q[10005];
int js(int x,int y)
{
	int sum=1;
	for(int i=1;i<=x;i++)
		sum*=i;
		sum=sum/6;
		for(int i=1;i<=x-y;i++)
		sum/=i;
		return sum;
}
int main()
{
	freopen("hopetree.in","r",stdin);
	freopen("hopetree.out","w",stdout);
	cin>>m;
	for(int i=1;i<m;i++)
	{
		cin>>u>>v;	
		q[u].push_back(v);
		q[v].push_back(u);
	}
	for(int i=1;i<=m;i++)
	{
		if(q[i].size()>=3)t+=js(q[i].size(),3);
	}
	cout<<t%338 + 1<<" ";
	t=(t+233)%338+1;
	cout<<t<<endl;
	return 0;
}