#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <limits>
#include <ctime>
#include <cassert>
#include <map>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <stack>
#include <queue>
#include <numeric>
#include <iterator>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const string& x, char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T, class S, class U, class V> void writerLn(T x, S y, U z, V v) { writer(x, ' '); writer(y, ' '); writer(z, ' '); writer(v, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }

template<class T> void chmin(T& a, const T& b) { if (a > b) a = b; }
template<class T> void chmax(T& a, const T& b) { if (a < b) a = b; }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
ll mod_inv(ll a, ll m) { ll x, y; extgcd<ll>(a, m, x, y); return (m + x % m) % m; }

vector<int> e[100];

Pii diameter_dfs(int p, int v) {
	Pii ret(0, v);
	for (auto to : e[v]) if (to != p) {
		Pii tmp = diameter_dfs(v, to);
		tmp.first++;
		if (ret.first < tmp.first) ret = tmp;
	}
	return ret;
}
int diameter(int v) {
	Pii x = diameter_dfs(-1, v);
	Pii y = diameter_dfs(-1, x.second);
	return y.first;
}

bool centerDfs(int v, int par, int far2, vector<int>& ret) {
	if (v == far2) {
		ret.push_back(far2);
		return true;
	}
	for (auto to : e[v]) {
		if (to == par) continue;
		bool b = centerDfs(to, v, far2, ret);
		if (b) {
			ret.push_back(v);
			return true;
		}
	}

	return false;
}

Pii findCenters(int far1, int far2) {
	vector<int> path;
	centerDfs(far1, -1, far2, path);
	int a = path[(sz(path) - 1) / 2];
	int b = path[(sz(path)) / 2];

	return Pii(a, b);
}

int dep[100];
void initDep(Pii centers) {
	memset(dep, -1, sizeof(dep));
	dep[centers.first] = dep[centers.second] = 0;

	queue<int> q;
	q.push(centers.first);
	if (centers.first != centers.second) q.push(centers.second);

	while (!q.empty()) {
		int cur = q.front(); q.pop();
		for (auto to : e[cur]) {
			if (dep[to] != -1) continue;
			dep[to] = dep[cur] + 1;
			q.push(to);
		}
	}
}

ll calcAns(int n, Pii centers) {
	initDep(centers);
	map<int, int> mxChilds;
	FOR(i, n) {
		int d = dep[i];
		int ch = 0;
		for (auto to : e[i]) {
			if (d + 1 == dep[to]) {
				ch++;
			}
		}
		chmax(mxChilds[d], ch);
	}

	ll ans = 1;
	if (centers.first != centers.second) ans = 2;
	for (auto& kv : mxChilds) {
		if (kv.second != 0) {
			ans *= kv.second;
		}
	}

	return ans;
}

Pll solve(int n) {

	int far1 = diameter_dfs(-1, 0).second;
	Pii y = diameter_dfs(-1, far1);
	int dim = y.first;
	int far2 = y.second;

	Pii centers = findCenters(far1, far2);

	ll ans = calcAns(n, centers);
	if (centers.first == centers.second) {
		for (auto to : e[centers.first]) {
			ll ans2 = calcAns(n, Pii(centers.first, to));
			chmin(ans, ans2);
		}
	}

	return Pll(dim / 2 + 1, ans);
}

int main() {
	int n; reader(n);
	FOR(i, n - 1) {
		int a, b; reader(a, b);
		a--; b--;
		e[a].push_back(b);
		e[b].push_back(a);
	}

	auto ans = solve(n);
	writerLn(ans.first, ans.second);

	return 0;
}

Measured memory_bytes: 256