#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T &a,T b){if(a>b)a=b;}
constexpr int INF=1000000000000000000;
constexpr int mod=1000000007;
constexpr double eps=1e-8;
const double pi=acos(-1);
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int Random(int mi,int ma){
    random_device rnd;
    mt19937 mt(rnd());//32bit
    //[mi,ma]
    uniform_int_distribution<int>engine(mi,ma);
    return engine(mt);
}
int gcd(int a,int b){
    if(b==0)return a;
    return gcd(b,a%b);
}
int lcm(int a,int b){
    return a/gcd(a,b)*b;
}
bool prime(int a){
    if(a==1)return false;
    for(int i=2;i*i<=a;i++){
        if(a%i==0)return false;
    }
    return true;
}
int modpow(int a,int b){
    if(b==0)return 1;
    if(b%2)return modpow(a,b-1)*a%mod;
    int memo=modpow(a,b/2);
    return memo*memo%mod;
}
vector<int>kaijo,invkaijo;
void init_fact(int n){
    kaijo.resize(n+1);
    invkaijo.resize(n+1);
    kaijo[0]=1;
    for(int i=1;i<=n;i++){
        kaijo[i]=kaijo[i-1]*i;
        kaijo[i]%=mod;
    }
    rep(i,n+1)invkaijo[i]=modpow(kaijo[i],mod-2);
}
int comb(int a,int b){
    if(a<b)return 0;
    if(a<0||b<0)return 0;
    return kaijo[a]*invkaijo[a-b]%mod*invkaijo[b]%mod;
}
int inv(int x){
    x=modpow(x,mod-2);
    return x;
}
vector<int>G[110];
int n,dist[2][110],d[110];
bool used[110];
void dfs(int x){
    used[x]=true;
    for(int i:G[x]){
        if(!used[i]&&d[i]>d[x]+1){
            d[i]=d[x]+1;
            dfs(i);
        }
    }
}
int bfs(int x,int id){
    fill(dist[id],dist[id]+n,INF);
    int res=-1;
    queue<int>q;
    dist[id][x]=0;
    q.push(x);
    while(!q.empty()){
        int p=q.front();
        q.pop();
        res=p;
        for(int i:G[p]){
            if(dist[id][i]>dist[id][p]+1){
                dist[id][i]=dist[id][p]+1;
                q.push(i);
            }
        }
    }
    return res;
}
P calc1(int x){
    fill(d,d+n,INF);
    fill(used,used+n,false);
    d[x]=1;
    dfs(x);
    map<int,int>mp;
    rep(i,n){
        chmax(mp[d[i]],(int)G[i].size()-(d[i]==1?0:1));
    }
    int res=1;
    for(P p:mp)if(p.se)res*=p.se;
    return {*max_element(d,d+n),res};
}
P calc2(int a,int b){
    fill(d,d+n,INF);
    fill(used,used+n,false);
    d[a]=d[b]=1;
    dfs(a);
    dfs(b);
    map<int,int>mp;
    rep(i,n){
        chmax(mp[d[i]],(int)G[i].size()-1);
    }
    int res=2;
    for(P p:mp)if(p.se)res*=p.se;
    return {*max_element(d,d+n),res};
}
signed main(){
    cin.tie(0);ios::sync_with_stdio(false);
    cin>>n;
    rep(i,n-1){
        int a,b;
        cin>>a>>b;
        a--,b--;
        G[a].pb(b);
        G[b].pb(a);
    }
    int l=bfs(0,1);
    int r=bfs(l,0);
    bfs(r,1);
    int di=*max_element(dist[0],dist[0]+n);
    P ans={INF,INF};
    if(di%2==0){
        int c=-1;
        rep(i,n){
            if(dist[0][i]==di/2&&dist[1][i]==di/2)c=i;
        }
        chmin(ans,calc1(c));
        for(int i:G[c])chmin(ans,calc2(i,c));
    }
    else{
        int a=-1,b=-1;
        rep(i,n){
            if(dist[0][i]==di/2&&dist[1][i]==di/2+1)a=i;
            if(dist[0][i]==di/2+1&&dist[1][i]==di/2)b=i;
        }
        chmin(ans,calc2(a,b));
    }
    cout<<ans.fi<<" "<<ans.se<<endl;
    return 0;
}

Measured memory_bytes: 3676