#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
//#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
    return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(4) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}


const int N = 111;

vi g[N];
int from[N];

int dfs(int v, int par) {
    int ret = 0;
    from[v] = -1;
    for (int to : g[v]) {
        if (to == par)
            continue;
        int cur = dfs(to, v);
        if (cur > ret) {
            ret = cur;
            from[v] = to;
        }
    }
    return ret + 1;
}

int cnt[N];

void dfs2(int v, int par, int dip) {
    inmax(cnt[dip], SZ(g[v]) - (par != -1));
    for (int to : g[v]) {
        if (to == par)
            continue;
        dfs2(to, v, dip + 1);
    }
}


ull solve(int root) {
    fill(cnt, cnt + N, 0);
    dfs2(root, -1, 0);
    ull ans2 = 1;
    for (int i = 0; cnt[i]; ++i) {
        ans2 *= cnt[i];
    }
    return ans2;
}

void smain() {

    int n;
    cin >> n;
    fori (i, n - 1) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }


    dfs(1, -1);
    int v = 1;
    while (from[v] != -1) {
        v = from[v];
    }

    dfs(v, -1);
    int u = v;
    vi verts = {v};
    while (from[u] != -1) {
        u = from[u];
        verts.push_back(u);
    }
    int root;
    int ans = (SZ(verts) + 1) >> 1;
    ull ans2;
    if (SZ(verts) & 1) {
        root = verts[SZ(verts) >> 1];
        ans2 = solve(root);
        vi tos;
        for (int to : g[root]) {
            tos.push_back(to);
        }
        for (int to : tos) {
            u = to;
            v = root;

            int z = n + 1;
            g[z].push_back(u);
            g[z].push_back(v);
            g[u].push_back(z);
            g[v].push_back(z);
            g[u].erase(find(ALL(g[u]), v));
            g[v].erase(find(ALL(g[v]), u));
            ull cur = solve(z);
            if (ans2 > cur)
                ans2 = cur;
            g[u].erase(find(ALL(g[u]), z));
            g[v].erase(find(ALL(g[v]), z));
            g[u].push_back(v);
            g[v].push_back(u);
            g[z].clear();
        }
    } else {
        int u = verts[SZ(verts) >> 1];
        int v = verts[(SZ(verts) >> 1) - 1];
        int z = n + 1;
        g[z].push_back(u);
        g[z].push_back(v);
        g[u].push_back(z);
        g[v].push_back(z);
        g[u].erase(find(ALL(g[u]), v));
        g[v].erase(find(ALL(g[v]), u));
        ans2 = solve(z);
    }


    cout << ans << ' ' << ans2;

}

Measured memory_bytes: 384