/**
 *    author:  otera    
**/
#include<iostream>
#include<string> 
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm> 
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<63 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a >= b) { a = b; return 1; } return 0; }

int n;
vector<vector<int>> g;

void dfs(int v, int p, int d, vector<int> &dep) {
    dep[v] = d;
    for(int nv: g[v]) {
        if(nv == p) continue;
        dfs(nv, v, d + 1, dep);
    }
}

void solve() {
	cin >> n;
    g.assign(n, vector<int>());
    rep(i, n - 1) {
        int a, b; cin >> a >> b;
        -- a, -- b;
        g[a].pb(b);
        g[b].pb(a);
    }
    int cmi = inf; ul lmi = INF;
    //中心が1つ
    rep(i, n) {
        vector<int> d(n, inf);
        dfs(i, -1, 0, d);
        int ma = 0;
        rep(j, n) {
            chmax(ma, d[j]);
        }
        int cm = cmi;
        if(chmin(cmi, ma + 1)) {
            vector<int> cnt(cmi + 1, 0);
            cnt[0] = (int)g[i].size();
            rep(j, n) {
                if(j == i) continue;
                chmax(cnt[d[j]], (int)g[j].size() - 1);
            }
            ul res = (ul)1;
            for(int j = 0; j < ma; ++ j) {
                res *= (ul)cnt[j];
            }
            if(cm == ma + 1) chmin(lmi, res);
            else lmi = res;
        }
    }
    //中心が2つ
    rep(i, n) {
        for(int j: g[i]) {
            vector<int> d(n, inf);
            dfs(i, j, 0, d);
            dfs(j, i, 0, d);
            int ma = 0;
            rep(k, n) {
                chmax(ma, d[k]);
            }
            int cm = cmi;
            if(chmin(cmi, ma + 1)) {
                vector<int> cnt(cmi + 1, 0);
                cnt[0] = max((int)g[i].size() - 1, (int)g[j].size() - 1);
                rep(k, n) {
                    if(k == i || k == j) continue;
                    chmax(cnt[d[k]], (int)g[k].size() - 1);
                }
                ul res = (ul)2LL;
                for(int k = 0; k < ma; ++ k) {
                    res *= (ul)cnt[k];
                }
                if(cm == ma + 1) chmin(lmi, res);
                else lmi = res;
            }
        }
    }
    cout << cmi << " " << lmi << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//int t; cin >> t; rep(i, t)solve();
	solve();
    return 0;
}

Measured memory_bytes: 256