#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;

template <typename T1, typename T2>
string print_iterable(T1 begin_iter, T2 end_iter, int counter) {
    bool done_something = false;
    stringstream res;
    res << "[";
    for (; begin_iter != end_iter and counter; ++begin_iter) {
        done_something = true;
        counter--;
        res << *begin_iter << ", ";
    }
    string str = res.str();
    if (done_something) {
        str.pop_back();
        str.pop_back();
    }
    str += "]";
    return str;
}

vector<int> SortIndex(int size, std::function<bool(int, int)> compare) {
    vector<int> ord(size);
    for (int i = 0; i < size; i++) ord[i] = i;
    sort(ord.begin(), ord.end(), compare);
    return ord;
}

template <typename T>
bool MinPlace(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool MaxPlace(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename Container>
int SZ(const Container& S) { return S.size(); }

template <typename S, typename T>
ostream& operator <<(ostream& out, const pair<S, T>& p) {
    out << "{" << p.first << ", " << p.second << "}";
    return out;
}

template <typename T>
ostream& operator <<(ostream& out, const vector<T>& v) {
    out << "[";
    for (int i = 0; i < (int)v.size(); i++) {
        out << v[i];
        if (i != (int)v.size()-1) out << ", ";
    }
    out << "]";
    return out;
}

#if DEBUG && !ONLINE_JUDGE
    ifstream input_from_file("input.txt");
    #define cin input_from_file

    #define dbg_var(x) clog << #x  << ": " << x << endl;
    #define dbg_array(x, len) clog << #x << ": " << print_iterable(x, x+len, -1) << endl;
#else
    #define dbg_var(x)
    #define dbg_array(x, len)
#endif

///////////////////////////////////////////////////////////////////////////
//////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
///////////////////////////////////////////////////////////////////////////

const int MAXN = 110;

vector<int> aa[MAXN];
int dfs(int v, int p, int depth, vector<int>& children) {
    int l = aa[v].size();
    if (p != 0) l--;
    children[depth] = max(children[depth], l);
    int res = -1;
    for (int a : aa[v]) {
        if (a == p) continue;
        res = max(dfs(a, v, depth+1, children), res);
    }
    return res+1;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); // Remove in problems with online queries!

    int N;
    cin >> N;
    for (int i = 0; i < N-1; i++) {
        int a, b;
        cin >> a >> b;
        aa[a].push_back(b);
        aa[b].push_back(a);
    }
    LL leaves_best = 2e18;
    int color_num = 1000;
    for (int v = 1; v <= N; v++) {
        vector<int> children(N, 0);
        int dep = dfs(v, 0, 0, children);
        double leaves_doub = 1;
        LL leaves = 1;
        for (int i = 0; i < N; i++) {
            if (children[i] == 0) break;
            leaves *= children[i];
            leaves_doub *= children[i];
        }
        if (leaves_doub > 2e18) continue;
        if (dep+1 > color_num) continue;
        if (dep+1 < color_num) color_num = dep+1, leaves_best = 2e18;
        leaves_best = min(leaves_best, leaves);
    }
    for (int v = 1; v <= N; v++) {
        for (int u : aa[v]) {
            vector<int> children(N, 0);
            int dep1 = dfs(v, u, 0, children);
            int dep2 = dfs(u, v, 0, children);
            int dep = max(dep1, dep2);
            double leaves_doub = 1;
            LL leaves = 2;
            for (int i = 0; i < N; i++) {
                if (children[i] == 0) break;
                leaves *= children[i];
                leaves_doub *= children[i];
            }
            if (leaves_doub > 2e18) continue;
            if (dep+1 > color_num) continue;
            if (dep+1 < color_num) color_num = dep+1, leaves_best = 2e18;
            leaves_best = min(leaves_best, leaves);
        }
    }
    
    cout << color_num << " " << leaves_best << "\n";
}



Measured memory_bytes: 256