#include <bits/stdc++.h>
// created [2019/11/10] 21:43:43
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using uint = unsigned int;
using usize = std::size_t;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};

template<typename T>
T read()
{
    T v;
    return std::cin >> v, v;
}
template<typename T, typename... Args>
auto read(const usize size, Args... args)
{
    std::vector<decltype(read<T>(args...))> ans(size);
    for (usize i = 0; i < size; i++) { ans[i] = read<T>(args...); }
    return ans;
}
template<typename... Types>
auto reads() { return std::tuple<std::decay_t<Types>...>{read<Types>()...}; }
#    define SHOW(...) static_cast<void>(0)
template<typename T>
T make_v(const T v) { return v; }
template<typename... Args>
auto make_v(const std::size_t size, Args... args) { return std::vector<decltype(make_v(args...))>(size, make_v(args...)); }


template<typename Cost>
class base_graph
{
public:
    using cost_type = Cost;
    base_graph(const usize sz) : sz{sz}, edges(sz), rev_edges(sz) {}
    void add_edge(const usize from, const usize to, const Cost cost, const bool bi = false)
    {
        assert(from < sz), assert(to < sz);
        edges[from].push_back(edge{from, to, cost}), rev_edges[to].push_back(edge(to, from, cost));
        if (bi) { add_edge(to, from, cost, false); }
    }
    struct edge
    {
        edge(const usize from, const usize to, const Cost cost) : from{from}, to{to}, cost{cost} {}
        usize from, to;
        Cost cost;
        bool operator<(const edge& e) const { return cost != e.cost ? cost < e.cost : to < e.to; }
    };
    std::vector<edge>& operator[](const usize i) { return assert(i < sz), edges[i]; }
    const std::vector<edge>& operator[](const usize i) const { return assert(i < sz), edges[i]; }
    const std::vector<std::vector<edge>>& rev_edge() const { return rev_edges; }
    std::vector<std::vector<edge>>& rev_edge() { return rev_edges; }
    friend std::ostream& operator<<(std::ostream& os, const base_graph& g)
    {
        os << "[\n";
        for (usize i = 0; i < g.sz; i++) {
            for (const auto& e : g.edges[i]) { os << i << "->" << e.to << ":" << e.cost << "\n"; }
        }
        return (os << "]\n");
    }
    static usize to(const edge& e) { return e.to; }
    usize size() const { return sz; }

private:
    const usize sz;
    std::vector<std::vector<edge>> edges, rev_edges;
};
template<>
class base_graph<void>
{
public:
    base_graph(const usize sz) : sz{sz}, edges(sz), rev_edges(sz) {}
    void add_edge(const usize from, const usize to, const bool bi = false)
    {
        assert(from < sz), assert(to < sz);
        edges[from].push_back(to), rev_edges[to].push_back(from);
        if (bi) { add_edge(to, from, false); }
    }
    std::vector<usize>& operator[](const usize i) { return assert(i < sz), edges[i]; }
    const std::vector<usize>& operator[](const usize i) const { return assert(i < sz), edges[i]; }
    const std::vector<std::vector<usize>>& rev_edge() const { return rev_edges; }
    std::vector<std::vector<usize>>& rev_edge() { return rev_edges; }
    friend std::ostream& operator<<(std::ostream& os, const base_graph& g)
    {
        os << "[\n";
        for (usize i = 0; i < g.sz; i++) {
            for (const usize to : g.edges[i]) { os << i << "->" << to << "\n"; }
        }
        return (os << "]\n");
    }
    static usize to(const usize e) { return e; }
    usize size() const { return sz; }

private:
    const usize sz;
    std::vector<std::vector<usize>> edges, rev_edges;
};
using graph = base_graph<void>;
using tree  = graph;
template<typename Cost>
using cost_graph = base_graph<Cost>;
template<typename Cost>
using cost_tree = cost_graph<Cost>;
template<typename Cost>
std::vector<std::size_t> diameter(const cost_tree<Cost>& tree)
{
    const std::size_t sz = tree.size();
    std::vector<Cost> dist(sz, 0);
    std::vector<std::size_t> p(sz, sz);
    auto dfs = [&](auto&& self, const std::size_t s, const std::size_t prev) -> void {
        for (const auto& e : tree[s]) {
            if (e.to == prev) { continue; }
            dist[e.to] = dist[s] + e.cost, p[e.to] = s;
            self(self, e.to, s);
        }
    };
    dfs(dfs, 0, sz);
    std::size_t r = std::max_element(dist.begin(), dist.end()) - dist.begin();
    dist[r]       = 0, std::fill(p.begin(), p.end(), sz), dfs(dfs, r, sz);
    r             = std::max_element(dist.begin(), dist.end()) - dist.begin();
    std::vector<std::size_t> ans;
    for (; r != sz; r = p[r]) { ans.push_back(r); }
    return ans;
}
template<>
std::vector<std::size_t> diameter(const tree& tree)
{
    const std::size_t sz = tree.size();
    std::vector<std::size_t> dist(sz, 0);
    std::vector<std::size_t> p(sz, sz);
    auto dfs = [&](auto&& self, const std::size_t s, const std::size_t prev) -> void {
        for (const std::size_t to : tree[s]) {
            if (to == prev) { continue; }
            dist[to] = dist[s] + 1, p[to] = s;
            self(self, to, s);
        }
    };
    dfs(dfs, 0, sz);
    std::size_t r = std::max_element(dist.begin(), dist.end()) - dist.begin();
    dist[r]       = 0, std::fill(p.begin(), p.end(), sz), dfs(dfs, r, sz);
    r             = std::max_element(dist.begin(), dist.end()) - dist.begin();
    std::vector<std::size_t> ans;
    for (; r != sz; r = p[r]) { ans.push_back(r); }
    return ans;
}
int main()
{
    const auto n = read<usize>();
    graph g(2 * n - 1);
    for (usize i = 0; i < n - 1; i++) {
        const auto u = read<usize>() - 1, v = read<usize>() - 1;
        g.add_edge(n + i, u, true), g.add_edge(n + i, v, true);
    }
    const auto ds = diameter(g);
    usize c       = ds[ds.size() / 2];
    using pii     = std::pair<usize, ull>;
    pii min{inf_v<usize>, inf_v<ull>};
    auto f = [&](const usize c) {
        std::vector<ull> dmax(2 * n - 1, 1);
        usize dM = 0;
        auto dfs = [&, n](auto&& self, const usize s, const usize p, const usize d) -> void {
            chmax(dM, d), chmax(dmax[d], (ull)g[s].size() - (p == 2 * n - 1 ? 0 : 1));
            for (const usize to : g[s]) {
                if (to == p) { continue; }
                self(self, to, s, d + 1);
            }
        };
        dfs(dfs, c, 2 * n - 1, 0);
        ull ans = 1;
        for (usize i = 0; i < 2 * n - 1; i++) { ans *= dmax[i]; }
        chmin(min, {dM / 2 + 1, ans});
    };
    f(c);
    for (const usize to : g[c]) { f(to); }
    std::cout << min.first << " " << min.second << std::endl;
    return 0;
}


Measured memory_bytes: 256