#include <cstdlib>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <stack>
#include <vector>
#include <map>
#include <queue>
#include <ctime>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int uint;
const int inf=1061109567;
const int maxn=5010;
const int maxm=100010;
const int mod=338;
const double pi=3.14;

struct node
{
    int pos;
    int dist;
};

vector<int> G[maxn];

int d1[maxn][maxn];
int d2[maxn][maxn];
int vis[maxn];

void build_tree(int u,int deep)
{
    vis[u]=1;//depth[u]=deep;
    int len=G[u].size();
    for(int i=0;i<len;i++)
    {
        int v=G[u][i];
        if(!vis[v])
        {
            vis[v]=1;
            build_tree(v,deep+1);
        }
    }
}

void BFS(int st)
{
    queue<node> q;vis[st]=1;
    q.push((node){st,0});
    while(!q.empty())
    {
        node u=q.front();
        q.pop();
        int len=G[u.pos].size();
        for(int i=0;i<len;i++)
        {
            int v=G[u.pos][i];
            if(!vis[v])
            {
                q.push((node){v,u.dist+1});
                d1[st][u.dist+1]++;
                d2[st][v]=u.dist+1;vis[v]=1;
            }
        }
    }
}

int main()
{
    freopen("hopetree.in","r",stdin);
    freopen("hopetree.out","w",stdout);
    //clock_t st=clock();
    int n,u,v;scanf("%d",&n);
    //mk=int(log2(n+0.5));
    for(int i=1;i<n;i++)
    {
        scanf("%d%d",&u,&v);
        G[u].push_back(v);
        G[v].push_back(u);
    }
    //build_tree(1,1);
    for(int i=1;i<=n;i++)
    {
        memset(vis,0,sizeof(vis));
        BFS(i);
    }
    int ans=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=i+1;j<=n;j++)
        {
            if(i==j) continue;
            for(int k=1;k<=n;k++)
            {
                if(d2[i][k]==d2[k][j]&&d2[i][k]+d2[k][j]==d2[i][j])
                {
                    if(d1[k][d2[i][k]]>2)
                    {
                        ans+=d1[k][d2[i][k]]-2;
                        ans%=mod;//printf("%d %d %d\n",i,j,k);
                    }
                }
            }
        }
    }
    ans=(ans*113)%mod;
    printf("%d %d\n",ans+1,(ans+233)%mod+1);
    //clock_t ed=clock();
    //printf("\nTime used : %.5lf Ms\n",double(ed-st)/CLOCKS_PER_SEC);
    return 0;
}