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 C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;

class TEST{
	static void Main(){
		Sol mySol =new Sol();
		mySol.Solve();
	}
}

class Sol{
	public void Solve(){
		
		if(N == 2){
			Console.WriteLine("{0} {1}",1, 0);
			return;
		}
			
		E = new HashSet<int>[N];
		for(int i=0;i<N;i++) E[i] = new HashSet<int>();
		for(int i=0;i<N-1;i++){
			E[A[i]].Add(B[i]);
			E[B[i]].Add(A[i]);
		}
		
		
		int[] farthest = new int[2];
		int[] depth = null;
		int[] parent = null;
		for(int t=0;t<2;t++){
			var rt = farthest[0];
			depth = new int[N];
			parent = new int[N];
			depth[rt] = 0;
			parent[rt] = -1;
			int maxdep = 0;
			int deepest = rt;
			var q = new Queue<int>();
			q.Enqueue(rt);
			while(q.Count > 0){
				var now = q.Dequeue();
				foreach(var nxt in E[now]){
					if(nxt != parent[now]){
						depth[nxt] = depth[now] + 1;
						parent[nxt] = now;
						if(depth[nxt] > maxdep){
							maxdep = depth[nxt];
							deepest = nxt;
						}
						q.Enqueue(nxt);
					}
				}
			}
			farthest[t] = deepest;
		}
		
		int diam = depth[farthest[1]];
		List<int> tops = new List<int>();
		for(int now = farthest[1]; now != farthest[0]; now = parent[now]){
			if(diam % 2 == 0){
				if(depth[now] == diam / 2) tops.Add(now);
			} else {
				if(depth[now] == diam / 2 || depth[now] == diam / 2 + 1) tops.Add(now);
			}
		}
		
		List<List<int>> candis = new List<List<int>>();
		candis.Add(tops);
		if(tops.Count == 1){
			foreach(var nxt in E[tops[0]]){
				candis.Add(new List<int>(){ tops[0], nxt});
			}
		}
		
		long min = long.MaxValue;
		foreach(var ctops in candis){
			
			long[] dp = new long[diam / 2 + 1];
			depth = new int[N];
			parent = new int[N];
			var qq = new Queue<int>();
			foreach(var n in ctops){ 
				depth[n] = 0;
				parent[n] = -1;
				qq.Enqueue(n);
			}
			if(ctops.Count == 2){
				E[ctops[0]].Remove(ctops[1]);
				E[ctops[1]].Remove(ctops[0]);
			}
			while(qq.Count > 0){
				var now = qq.Dequeue();
				int nchild = E[now].Count;
				if(parent[now] != -1) nchild--;
				dp[depth[now]] = Math.Max(dp[depth[now]], nchild);
				foreach(var nxt in E[now]){
					if(nxt != parent[now]){
						depth[nxt] = depth[now] + 1;
						parent[nxt] = now;
						qq.Enqueue(nxt);
					}
				}
			}
			
			
			long ans = (long) ctops.Count;
			for(int i=0;i<dp.Length - 1;i++) ans *= dp[i];
			min = Math.Min(min, ans);
			
			if(ctops.Count == 2){
				E[ctops[0]].Add(ctops[1]);
				E[ctops[1]].Add(ctops[0]);
			}
		}
		Console.WriteLine("{0} {1}", diam / 2 + 1, min);
		
	}
	
	HashSet<int>[] E;
	
	
	
	int N;
	int[] A,B;
	public Sol(){
		N = ri();
		A = new int[N-1]; B = new int[N-1];
		for(int i=0;i<N-1;i++){
			var d = ria();
			A[i] = d[0] - 1; B[i] = d[1] - 1;
		}
	}

	static String rs(){return Console.ReadLine();}
	static int ri(){return int.Parse(Console.ReadLine());}
	static long rl(){return long.Parse(Console.ReadLine());}
	static double rd(){return double.Parse(Console.ReadLine());}
	static String[] rsa(char sep=' '){return Console.ReadLine().Split(sep);}
	static int[] ria(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>int.Parse(e));}
	static long[] rla(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>long.Parse(e));}
	static double[] rda(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>double.Parse(e));}
}