/*

This Submission is to determine how many 120/240 min const. delivery point there are.

//info
120 req. steps <= 5
*/
#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <bitset>
using namespace std;
typedef string::const_iterator State;
#define Ma_PI 3.141592653589793
#define eps 1e-5
#define LONG_INF 1e18
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define MOD 998244353
#define seg_size 262144
#define REP(a,b) for(long long a = 0;a < b;++a)

unsigned long xor128() {
	static unsigned long x = time(NULL), y = 362436069, z = 521288629, w = 88675123;
	unsigned long t = (x ^ (x << 11));
	x = y; y = z; z = w;
	return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
double dot(complex<double> a, complex<double> b) {
	return a.real() * b.real() + a.imag() * b.imag();
}
double gyaku_dot(complex<double> a, complex<double> b) {
	return a.real() * b.imag() - a.imag() * b.real();
}
double leng(complex<double> a) {
	return sqrt(a.real() * a.real() + a.imag() * a.imag());
}
double angles(complex<double> a, complex<double> b) {
	double cosine = dot(a, b) / (leng(a) * leng(b));
	double sine = gyaku_dot(a, b) / (leng(a) * leng(b));
	double kaku = acos(min((double)1.0, max((double)-1.0, cosine)));
	if (sine <= 0) {
		kaku = 2 * Ma_PI - kaku;
	}
	return kaku;
}
vector<int> convex_hull(vector<complex<double>> a) {
	vector<int> ans;
	double now_minnest = a[0].real();
	int now_itr = 0;
	REP(i, a.size()) {
		if (now_minnest > a[i].real()) {
			now_minnest = a[i].real();
			now_itr = i;
		}
	}
	ans.push_back(now_itr);
	complex<double> ba(0, 1);
	while (true) {
		int now_go = 0;
		double now_min = 0;
		double now_length = 0;
		int starter = ans[ans.size() - 1];
		for (int i = 0; i < a.size(); ++i) {
			if (i != starter) {
				double goa = angles(ba, a[i] - a[starter]);
				if (goa - now_min >= eps || (abs(goa - now_min) <= eps && (abs(a[i] - a[starter]) - now_length) >= eps)) {
					now_min = goa;
					now_go = i;
					now_length = abs(a[i] - a[starter]);
				}
			}
		}
		if (now_go == ans[0]) break;
		ans.push_back(now_go);
		ba = complex<double>(a[now_go] - a[starter]);
	}
	return ans;
}
#define int long long
vector<int> vertexs[200];
int distances[2000];
int backing[2000];
void dfs(int now, int back) {
	backing[now] = back;
	REP(q, vertexs[now].size()) {
		int go = vertexs[now][q];
		if (go == back) continue;
		distances[go] = distances[now] + 1;
		dfs(go, now);
	}
}
long long visited[2000] = {};
long long bobo[2000];
long long solve(long long a, long long b) {
	for (int i = 0; i < 2000; ++i) {
		visited[i] = 0;
		distances[i] = 0;
		bobo[i] = 0;
	}
	dfs(a, b);
	dfs(b, a);
	for (int i = 0;vertexs[i].size() != 0; ++i) {
		int hoge = 0;
		if (a != b||distances[i] !=0) {
			hoge = 1;
		}
		bobo[distances[i]] = max(bobo[distances[i]], (long long)vertexs[i].size() - hoge);
	}
	long long ans = 1;
	for (int i = 0; bobo[i] != 0; ++i) {
		if (ans >= 2e18/bobo[i]) {
			ans = 2e18;
		}
		else {
			ans *= bobo[i];
		}
	}
	if (a != b) {
		ans *= 2LL;
	}
	return ans;
}
#undef int
int main() {
#define int long long
	int n;
	cin >> n;
	REP(i, n - 1) {
		int a, b;
		cin >> a >> b;
		a--;
		b--;
		vertexs[a].push_back(b);
		vertexs[b].push_back(a);
	}
	dfs(0, -1);
	int now_max = 0;
	int now_itr = 0;
	REP(i, n) {
		if (distances[i] > now_max) {
			now_max = distances[i];
			now_itr = i;
		}
		distances[i] = 0;
	}
	dfs(now_itr, -1);
	now_max = -1;
	REP(i, n) {
		if (distances[i] > now_max) {
			now_max = max(now_max, distances[i]);
			now_itr = i;
		}
	}
	cout << (now_max + 2) / 2;
	vector<pair<int, int>> kouho;
	//構築
	vector<int> nya;
	nya.push_back(now_itr);
	while (backing[now_itr] != -1) {
		now_itr = backing[now_itr];
		nya.push_back(now_itr);
	}
	if (now_max % 2 == 1) {
		kouho.push_back(make_pair(nya[nya.size() / 2 - 1], nya[nya.size() / 2]));
	}
	else {
		for (int q = 0; q < n; ++q) {
			q = nya[nya.size() / 2];
			kouho.push_back(make_pair(q, q));
			for (int j = 0; j < vertexs[q].size(); ++j) {
				int go = vertexs[q][j];
				kouho.push_back(make_pair(q, go));
			}
			break;
		}
	}
	long long ans = 2e18;
	REP(i, kouho.size()) {
		ans = min(ans, solve(kouho[i].first, kouho[i].second));
	}
	cout << " " << ans << endl;
}

Measured memory_bytes: 504