// #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()

template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
using ll = int64_t;
using ull = uint64_t;
using PLL = pair<ll, ll>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return max(low, min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { t = clamp(t, low, high); }

namespace init__ {

struct InitIO {
    InitIO() {
        cin.tie(nullptr);
        ios_base::sync_with_stdio(false);
        cout << fixed << setprecision(30);
    }
} init_io;

}

#ifdef DEBUGGING
// #include "../debug/debug.cpp"
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

template <typename T>
T make_v(T init) { return init; }

template <typename T, typename... Tail>
auto make_v(T init, size_t s, Tail... tail) {
#define rec make_v(init, tail...)
    return V<decltype(rec)>(s, rec);
#undef rec
}

ll N;
VV<ll> edges;

PLL calc(ll start1, ll start2 = -1) {
    bool used[100] = {};
    queue<ll> que;
    used[start1] = true;
    que.push(start1);
    if(start2 != -1) {
        used[start2] = true;
        que.push(start2);
    }

    ll depth = 0;
    ll mul = que.size();
    while(que.size()) {
        depth++;
        queue<ll> nxtq;
        ll max_ch = 0;
        ll node_cnt = que.size();
        while(que.size()) {
            ll cur = que.front();
            que.pop();
            ll ch_cnt = 0;
            for(ll nxt : edges[cur]) {
                if(used[nxt]) continue;
                nxtq.push(nxt);
                ch_cnt++;
                used[nxt] = true;
            }
            chmax(max_ch, ch_cnt);
        }
        mul *= max<ll>(1, max_ch);
        que = move(nxtq);
    }
    DEBUG(make_tuple(start1, start2, depth, mul));
    return PLL(depth, mul);
}

const ll inf = 5e15;
PLL ans(inf, inf);

void update(PLL res) {
    ll a, b;
    tie(a, b) = res;
    if(a < ans.first) ans = res;
    else if(a == ans.first && b < ans.second) ans = res;
}

int main() {
    cin >> N;
    edges.resize(N);
    for(ll i = 1; i < N; i++) {
        ll a, b;
        cin >> a >> b;
        a--; b--;
        edges[a].push_back(b);
        edges[b].push_back(a);
    }

    for(ll i = 0; i < N; i++) {
        update(calc(i));
        for(ll j : edges[i]) update(calc(i, j));
    }

    ll a, b;
    tie(a, b) = ans;
    cout << a << ' ' << b << endl;
    return 0;
}


Measured memory_bytes: 256