#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef pair<pii,pii> P;
typedef tuple<ll,ll,ll> tl;
typedef pair<double,double> pdd;
typedef vector<vector<ll>> mat;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll mod5=1000000009;
ll inf=1LL<<62;
double pi=3.141592653589793238462643383279L;
double eps=1e-14;
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
#define mrep(itr,mp) for(auto& itr:mp)
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#define umh unordered_map<ll,ll,custom_hash>
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll lcm(ll a,ll b){
    ll c=gcd(a,b);
    return a*b/c;
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
    now%=md;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll popcount(ll n){
    ll ret=0;
    ll u=n;
    while(u>0){
        ret+=u%2;
        u/=2;
        
    }
    return ret;
}

vector<int> v[1000];
ull solve(ll n){
    queue<int> q;
    q.push(0);
    int r=0;
    bool used[n];
    fill(used,used+n,false);
    used[0]=true;
    while(q.size()>0){
        int now=q.front();q.pop();
        r=now;
        rep(i,0,v[now].size()){
            int ne=v[now][i];
            if(used[ne])continue;
            q.push(ne);
            used[ne]=true;
        }
    }
    int dis[n];
    fill(dis,dis+n,1000000000);
    dis[r]=0;
    int r2=r;
    q.push(r);
    int par[n];
    par[r]=-1;
    while(q.size()>0){
        int now=q.front();q.pop();
        r2=now;
        rep(i,0,v[now].size()){
            int ne=v[now][i];
            if(dis[ne]>dis[now]+1){
                dis[ne]=dis[now]+1;
                q.push(ne);
                par[ne]=now;
            }
        }
    }
    int tyo=dis[r2];
    ull ans[101];
    int dis2[n];
    fill(dis2,dis2+n,1000000000);
    while(dis[r2]>(tyo+1)/2){
        r2=par[r2];
    }
    dis2[r2]=0;
    q.push(r2);
    if(tyo%2){
        r2=par[r2];
        q.push(r2);
        dis2[r2]=0;
    }
    vector<int> w[101];
    while(q.size()>0){
        int now=q.front();q.pop();
        w[dis2[now]].push_back(now);
        rep(i,0,v[now].size()){
            int ne=v[now][i];
            if(dis2[ne]>dis2[now]+1){
                dis2[ne]=dis2[now]+1;
                q.push(ne);
            }
        }
    }
    ans[0]=w[0].size();
    rep(i,0,tyo/2){
        ull ma=0;
        rep(j,0,w[i].size()){
            int now=w[i][j];
            Max(ma,(ull)v[now].size());
        }
        ma--;
        if(tyo%2==0&&i==0)ma++;
        ans[i+1]=ans[i]*ma;
       // cout<<ma<<endl;
    }
    
    return ans[tyo/2];
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);
    int n;cin>>n;
    rep(i,0,n-1){
        int a,b;cin>>a>>b;
        a--;
        b--;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    queue<int> q;
    q.push(0);
    int r=0;
    bool used[n];
    fill(used,used+n,false);
    used[0]=true;
    while(q.size()>0){
        int now=q.front();q.pop();
        r=now;
        rep(i,0,v[now].size()){
            int ne=v[now][i];
            if(used[ne])continue;
            q.push(ne);
            used[ne]=true;
        }
    }
    int dis[n];
    fill(dis,dis+n,1000000000);
    dis[r]=0;
    int r2=r;
    q.push(r);
    int par[n];
    par[r]=-1;
    int maa=0;
    while(q.size()>0){
        int now=q.front();q.pop();
        r2=now;
        Max(maa,dis[now]);
        rep(i,0,v[now].size()){
            int ne=v[now][i];
            if(dis[ne]>dis[now]+1){
                dis[ne]=dis[now]+1;
                q.push(ne);
                par[ne]=now;
            }
        }
    }
    int tyo=dis[r2];
    cout<<tyo/2+1<<" ";
    ull mi=solve(n);
    //cout<<tyo<<endl;
    if(tyo%2){
        cout<<mi<<endl;
        return 0;
    }
    rep(i,0,n){
        if(v[i].size()==1){
            //cout<<i<<endl;
            queue<int> qq;
            qq.push(i);
            int dd[n];
            fill(dd,dd+n,1000000000);
            int maaa=0;
            dd[i]=0;
            while(qq.size()>0){
                int now=qq.front();qq.pop();
                maaa=dd[now];
                rep(j,0,v[now].size()){
                    int ne=v[now][j];
                    if(dd[ne]>dd[now]+1){
                        dd[ne]=dd[now]+1;
                        qq.push(ne);
                    }
                }
            }
            int cnt=tyo+1-maaa;
            int now=i;
            rep(j,0,cnt){
                v[now].push_back(n+j);
                v[n+j].push_back(now);
                now=n+j;
            }
            Min(mi,solve(n+cnt));
           // cout<<solve(n+cnt)<<endl;
            rep(j,n,n+cnt)v[j].clear();
            v[i].pop_back();
        }
    }
    cout<<mi<<endl;
    //ll cc=gcd(847872,884736);
   // cout<<847872/cc<<" "<<884736/cc<<endl;
    
}




Measured memory_bytes: 256