Problem:
Score : 1100 points

Problem Statement

Coloring of the vertices of a tree G is called a good coloring when, for every pair of two vertices u and v painted in the same color, picking u as the root and picking v as the root would result in isomorphic rooted trees.

Also, the colorfulness of G is defined as the minimum possible number of different colors used in a good coloring of G.

You are given a tree with N vertices. The vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i. We will construct a new tree T by repeating the following operation on this tree some number of times:

Add a new vertex to the tree by connecting it to one of the vertices in the current tree with an edge.

Find the minimum possible colorfulness of T.
Additionally, print the minimum number of leaves (vertices with degree 1) in a tree T that achieves the minimum colorfulness.

Notes

The phrase "picking u as the root and picking v as the root would result in isomorphic rooted trees" for a tree G means that there exists a bijective function f_{uv} from the vertex set of G to itself such that both of the following conditions are met:

f_{uv}(u)=v

For every pair of two vertices (a,b), edge (a,b) exists if and only if edge (f_{uv}(a),f_{uv}(b)) exists.

Constraints

2 \leq N \leq 100

1 \leq a_i,b_i \leq N(1\leq i\leq N-1)

The given graph is a tree.

Input

Input is given from Standard Input in the following format:

N
a_1 b_1
:
a_{N-1} b_{N-1}

Output

Print two integers with a space in between.
First, print the minimum possible colorfulness of a tree T that can be constructed.
Second, print the minimum number of leaves in a tree that achieves it.

It can be shown that, under the constraints of this problem, the values that should be printed fit into 64-bit signed integers.

Sample Input 1

5
1 2
2 3
3 4
3 5

Sample Output 1

2 4

If we connect a new vertex 6 to vertex 2, painting the vertices (1,4,5,6) red and painting the vertices (2,3) blue is a good coloring.
Since painting all the vertices in a single color is not a good coloring, we can see that the colorfulness of this tree is 2.
This is actually the optimal solution. There are four leaves, so we should print 2 and 4.

Sample Input 2

8
1 2
2 3
4 3
5 4
6 7
6 8
3 6

Sample Output 2

3 4

Sample Input 3

10
1 2
2 3
3 4
4 5
5 6
6 7
3 8
5 9
3 10

Sample Output 3

4 6

Sample Input 4

13
5 6
6 4
2 8
4 7
8 9
3 2
10 4
11 10
2 4
13 10
1 8
12 1

Sample Output 4

4 12

Solution in Rust (1.15.1) (judge verdict: Accepted)

use std::cmp;
use std::collections::VecDeque;

const INF: usize = 1_000_000_000_000_000_000;

fn main() {
    let mut sc = Scanner::new();
    let n: usize = sc.read();
    let mut tree = vec![vec![]; n];

    let mut edges = Vec::new();
    for _ in 0..(n - 1) {
        let p = sc.read::<usize>() - 1;
        let q = sc.read::<usize>() - 1;
        tree[p].push(q);
        tree[q].push(p);
        edges.push((p, q));
    }

    let mut min = (n + 1) / 2;
    let mut answers = Vec::new();
    for center in 0..n {
        let mut queue = VecDeque::new();
        let mut depth = vec![n; n];
        queue.push_back(center);
        depth[center] = 1;
        let mut max_depth = 1;
        while !queue.is_empty() {
            let s = queue.len();
            for _ in 0..s {
                let p = queue.pop_front().unwrap();
                for &to in &tree[p] {
                    if depth[to] <= depth[p] {
                        continue;
                    }
                    depth[to] = depth[p] + 1;
                    queue.push_back(to);
                    max_depth = cmp::max(max_depth, depth[to]);
                }
            }
        }

        min = cmp::min(min, max_depth);
        if min != max_depth {
            continue;
        }
        let mut max_children = calc_max_children(&tree, &depth, max_depth);
        max_children[0] = 1;
        let mut ans = 1;
        for i in 0..max_depth {
            ans *= max_children[i];
            if ans > INF {
                break;
            }
        }
        if ans <= INF {
            answers.push((min, ans));
        }
    }

    for &(p, q) in &edges {
        let mut queue = VecDeque::new();
        let mut depth = vec![n; n];
        queue.push_back(p);
        queue.push_back(q);
        depth[p] = 1;
        depth[q] = 1;
        let mut max_depth = 1;
        while !queue.is_empty() {
            let s = queue.len();
            for _ in 0..s {
                let p = queue.pop_front().unwrap();
                for &to in &tree[p] {
                    if depth[to] <= depth[p] {
                        continue;
                    }
                    depth[to] = depth[p] + 1;
                    queue.push_back(to);
                    max_depth = cmp::max(max_depth, depth[to]);
                }
            }
        }

        min = cmp::min(min, max_depth);
        if min != max_depth {
            continue;
        }
        let mut max_children = calc_max_children(&tree, &depth, max_depth);
        max_children[0] = 2;
        let mut ans = 1;
        for i in 0..max_depth {
            ans *= max_children[i];
            if ans > INF {
                break;
            }
        }
        if ans <= INF {
            answers.push((min, ans));
        }
    }

    answers.sort();
    let (p, q) = answers[0];

    println!("{} {}", p, q);
}

fn calc_max_children(tree: &Vec<Vec<usize>>, depth: &Vec<usize>, max_depth: usize) -> Vec<usize> {
    let n = tree.len();
    let mut max_children_count = vec![0; max_depth + 1];
    for i in 0..n {
        let mut children = 0;
        for &to in &tree[i] {
            if depth[to] <= depth[i] {
                continue;
            }
            children += 1;
        }
        max_children_count[depth[i]] = cmp::max(max_children_count[depth[i]], children);
    }
    return max_children_count;
}

struct Scanner {
    ptr: usize,
    length: usize,
    buf: Vec<u8>,
    small_cache: Vec<u8>,
}

impl Scanner {
    fn new() -> Scanner {
        Scanner {
            ptr: 0,
            length: 0,
            buf: vec![0; 1024],
            small_cache: vec![0; 1024],
        }
    }

    fn load(&mut self) {
        use std::io::Read;
        let mut s = std::io::stdin();
        self.length = s.read(&mut self.buf).unwrap();
    }

    fn byte(&mut self) -> u8 {
        if self.ptr >= self.length {
            self.ptr = 0;
            self.load();
            if self.length == 0 {
                self.buf[0] = b'\n';
                self.length = 1;
            }
        }

        self.ptr += 1;
        return self.buf[self.ptr - 1];
    }

    fn is_space(b: u8) -> bool {
        b == b'\n' || b == b'\r' || b == b'\t' || b == b' '
    }

    fn read<T>(&mut self) -> T
    where
        T: std::str::FromStr,
        T::Err: std::fmt::Debug,
    {
        let mut b = self.byte();
        while Scanner::is_space(b) {
            b = self.byte();
        }

        for pos in 0..self.small_cache.len() {
            self.small_cache[pos] = b;
            b = self.byte();
            if Scanner::is_space(b) {
                return String::from_utf8_lossy(&self.small_cache[0..(pos + 1)])
                    .parse()
                    .unwrap();
            }
        }

        let mut v = self.small_cache.clone();
        while !Scanner::is_space(b) {
            v.push(b);
            b = self.byte();
        }
        return String::from_utf8_lossy(&v).parse().unwrap();
    }
}