#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
    for(T& x: vec) {is >> x;} return is;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'['; for(T i: a) {out<<i<<',';} out<<']'; return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

struct dice {
  mt19937 mt;
  dice() {
    random_device rd;
    mt = mt19937(rd());
  }
  int operator()(int x) { return this->operator()(0, x); }
  int operator()(int x, int y) {
    uniform_int_distribution<int> dist(x, y-1);
    return dist(mt);
  }
} rnd;

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll n;
    cin >> n;
    vector<ll> a(n-1), b(n-1);
    vector<vector<ll>> g(n);
    REP(i, n-1) {
        cin >> a[i] >> b[i];
        a[i]--, b[i]--;
        g[a[i]].push_back(b[i]);
        g[b[i]].push_back(a[i]);
    }

    // // 木の葉の数をlとすると衝突する確率がl/MOD
    // vector<ll> r(n, -1);
    // function<ll(int,int,int)> hashingTree = [&](int v, int p, int d) {
    //     ll ret = 1;
    //     if(r[d] == -1) r[d] = rnd(MOD);
    //     for(auto to: g[v]) {
    //         if(to == p) continue;
    //         (ret *= (r[d] + hashingTree(to, v, d+1)) % MOD) %= MOD;
    //     }
    //     return ret;
    // };

    // vector<ll> hash(n);
    // REP(i, n) hash[i] = hashingTree(i, -1, 0);
    // vector<ll> vs(hash);
    // sort(ALL(vs));
    // vs.erase(unique(ALL(vs)), vs.end());
    // REP(i, n) hash[i] = lower_bound(ALL(vs), hash[i]) - vs.begin();

    // cout << hash << endl;

    // 各頂点を中心に
    ll ret = LLINF, leaf = LLINF;
    {
        REP(i, n) {
            ll dmax = 1;
            vector<ll> vleaf(n, 1);
            function<void(ll,ll,ll)> dfs = [&](ll v, ll p, ll d) {
                chmax(dmax, d);
                ll sz = 0;
                for(auto to: g[v]) {
                    if(to == p) continue;
                    dfs(to, v, d+1);
                    sz++;
                }
                chmax(vleaf[d-1], sz);
            };
            dfs(i, -1, 1);
            ll t = 1;
            REP(i, n) t *= vleaf[i];

            if(ret > dmax) {
                ret = dmax;
                leaf = t;
            } else if(ret == dmax && leaf > t) {
                leaf = t;
            }
        }
    }

    // 各辺を中心に
    {
        REP(i, n-1) {
            ll dmax = 1;
            vector<ll> vleaf(n, 1);
            function<void(ll,ll,ll)> dfs = [&](ll v, ll p, ll d) {
                chmax(dmax, d);
                ll sz = 0;
                for(auto to: g[v]) {
                    if(to == p) continue;
                    dfs(to, v, d+1);
                    sz++;
                }
                chmax(vleaf[d-1], sz);
            };
            dfs(a[i], b[i], 1);
            dfs(b[i], a[i], 1);
            ll t = 2;
            REP(i, n) t *= vleaf[i];

            if(ret > dmax) {
                ret = dmax;
                leaf = t;
            } else if(ret == dmax && leaf > t) {
                leaf = t;
            }
        }
    }

    cout << ret << " " << leaf << endl;

    return 0;
}


Measured memory_bytes: 256