#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5007;
int n;
vector <int> g[N];
int dep[N];
int root = -1;
map <int, int> cnt;
void pre_dfs(int v, int pr) {
dep[v] = 1;
for (int u : g[v]) {
if (u != pr) {
pre_dfs(u, v);
dep[v] = max(dep[v], dep[u] + 1);
}
}
}
void dfs(int v, int pr, int cur_mx, int cnt_n) {
if ((int) g[v].size() == 1 && v != root) {
cnt[cur_mx * cnt_n]++;
return;
}
vector <pair <int, int> > f;
for (int u : g[v]) {
if (u != pr) {
f.push_back({dep[u], u});
}
}
sort(f.begin(), f.end());
for (int u : g[v]) {
if (u != pr) {
if ((int) f.size() == 1) {
dfs(u, v, cur_mx, cnt_n + 1);
} else {
if (f.back().second == u) {
int new_mx = cur_mx;
new_mx = max(new_mx, f[(int) f.size() - 2].first);
dfs(u, v, new_mx, cnt_n + 1);
} else {
int new_mx = cur_mx;
new_mx = max(new_mx, f.back().first);
dfs(u, v, new_mx, cnt_n + 1);
}
}
}
}
}
void calc(int v) {
root = v;
memset(dep, sizeof dep, 0);
pre_dfs(v, 0);
dfs(v, 0, 0, 0);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n - 1; i++) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
for (int i = 1; i <= n; i++) {
if ((int) g[i].size() == 1) {
calc(i);
}
}
int mx = -1, mx_cnt = 0;
for (auto it : cnt) {
if (it.first > mx) {
mx = it.first;
mx_cnt = it.second;
}
}
cout << mx << ' ' << mx_cnt / 2 << '\n';
return 0;
}
