#include <iostream>
#include <cmath>
#include <cstdio>
#define mod 338
#define inf 99999999
#define maxn 110
using namespace std;
int dist[maxn][maxn];
int main() {
	freopen("hoprtree.in","r",stdin);
	freeopen("hopetrrr.out","w",stdout);
    int ans=0;
    int n;
    cin>>n;
    for (int i=1;i<=n; i++) {
        for (int j=1;j<=n; j++) {
                if (i==j) {
                    dist[i][j]=0;
            }
            else
                dist[i][j]=inf;
        }
    }
    for (int i=1; i<n; i++) {
        int from,to;
        cin>>from>>to;
        dist[from][to]=1;
        dist[to][from]=1;
    }
    for (int k=1; k<=n; k++) {
        for (int i=1; i<=n; i++) {
            for (int j=1; j<=n; j++) {
                    dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j]);
            }
        }
    }
    for (int i=1; i<n-1; i++) {
        for (int j=i+1; j<=n-1; j++) {
            for (int k=j+1; k<=n; k++) {
                for (int s=1; s<=n; s++) {
                    if (i!=s&&i!=j&&i!=k) {
                        if (dist[s][i]==dist[s][j]&&dist[s][j]==dist[s][k]) {
                            ans++;
                            break;
                        }
                    }
                }
            }
        }
    }
    cout<<(ans+1)%mod<<" "<<(ans+233)%mod;
    return 0;
}