#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <bitset>

using namespace std;

#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
template <typename T> void print_container(ostream& os, const T& c) { const char* _s = " "; if (!c.empty()) { __typeof__(c.begin()) last = --c.end(); foreach (it, c) { os << *it; if (it != last) os << _s; } } }
template <typename T> ostream& operator<<(ostream& os, const vector<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const set<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const deque<T>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "(" << p.first << ", " << p.second << ")"; return os; }

template <typename T> void print(T a, int n, const string& split = " ") { for (int i = 0; i < n; i++) { cout << a[i]; if (i + 1 != n) cout << split; } cout << endl; }
template <typename T> void print2d(T a, int w, int h, int width = -1, int br = 0) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) { if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; }
template <typename T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
#define dump(v) (cerr << #v << ": " << v << endl)

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define erep(i, n) for (int i = 0; i <= (int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define clr(a, x) memset(a, x, sizeof(a))
#define sz(a) ((int)(a).size())
#define mp(a, b) make_pair(a, b)
#define ten(n) ((long long)(1e##n))

template <typename T, typename U> void upmin(T& a, const U& b) { a = min<T>(a, b); }
template <typename T, typename U> void upmax(T& a, const U& b) { a = max<T>(a, b); }
template <typename T> void uniq(T& a) { sort(a.begin(), a.end()); a.erase(unique(a.begin(), a.end()), a.end()); }
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
template <class T> T to_T(const string& s) { istringstream is(s); T res; is >> res; return res; }
void fast_io() { cin.tie(0); ios::sync_with_stdio(false); }
bool in_rect(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }

typedef long long ll;
typedef pair<int, int> pint;

const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };


vector<int> g[128];

void dfs(const int cur, const int depth, vector<bool>& visited, vector<int>& max_children) {
    assert(cur < visited.size());
    visited[cur] = true;

    int children = 0;
    assert(cur < 128);
    for (int to : g[cur]) {
        // dump(to);
        // dump(visited.size());
        assert(to < visited.size());
        if (!visited[to]) {
            dfs(to, depth + 1, visited, max_children);
            ++children;
        }
    }
    upmax(max_children[depth], children);
}

int get_max_depth(const vector<int>& max_children) {
    int max_depth = 0;
    for (int i = 0; i < max_children.size(); ++i) {
        assert(i < max_children.size());
        if (max_children[i] != -1) {
            max_depth = i;
        }
    }
    return max_depth;
}

ll count_leaves(const vector<int>& max_children) {
    const int max_depth = get_max_depth(max_children);
    ll leaves = 1;
    for (int depth; depth < max_depth; ++depth) {
        assert(depth < max_children.size());
        leaves *= max_children[depth];
    }
    return leaves;
}

int main() {
    int n;
    cin >> n;
    rep(i, n - 1) {
        int a, b;
        cin >> a >> b;
        --a, --b;
    
        // dump(pint(a, b));
        g[a].push_back(b);
        g[b].push_back(a);
    }

    pair<int, ll> answer(114514, 1919810);

    rep(center, n) {
        vector<bool> visited(n);
        vector<int> max_children(n, -1);    // (depth) -> max_children
        dfs(center, 0, visited, max_children);

        const int colors = get_max_depth(max_children) + 1;
        const ll leaves = count_leaves(max_children);
        upmin(answer, make_pair(colors, leaves));
    }

    rep(center1, n) {
        for (int center2 : g[center1]) {
            vector<bool> visited(n);
            vector<int> max_children(n, -1);    // (depth) -> max_children
            visited[center1] = visited[center2] = true;

            dfs(center1, 0, visited, max_children);
            dfs(center2, 0, visited, max_children);

            const int colors = get_max_depth(max_children) + 1;
            const ll leaves = 2 * count_leaves(max_children);
            // if (make_pair(colors, leaves) < answer) {
            //     dump(pint(center1, center2));
            //     dump(colors);
            //     dump(leaves);
            // }
            upmin(answer, make_pair(colors, leaves));
        }
    }

    cout << answer.first << " " << answer.second << endl;
}

Measured memory_bytes: 256