#include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
ll readint(){
ll x=0,f=1; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int n,tot;
int v[1000005],nxt[1000005],h[500005],mx[500005],cnt[500005];
void addedge(int x,int y){
v[++tot]=y; nxt[tot]=h[x]; h[x]=tot;
v[++tot]=x; nxt[tot]=h[y]; h[y]=tot;
}
void dfs(int x,int px,int d){
mx[x]=d;
cnt[x]=1;
for(int p=h[x];p;p=nxt[p]){
if(v[p]==px) continue;
dfs(v[p],x,d+1);
if(mx[v[p]]==mx[x]) cnt[x]+=cnt[v[p]];
else if(mx[x]<mx[v[p]]) cnt[x]=cnt[v[p]];
mx[x]=max(mx[x],mx[v[p]]);
}
}
int main(){
n=readint();
for(int i=1;i<n;i++) addedge(readint(),readint());
ll res=0,c=1;
for(int i=1;i<=n;i++){
dfs(i,i,0);
vector<pii> f;
for(int p=h[i];p;p=nxt[p]) f.pb(mp(mx[v[p]],cnt[v[p]]));
sort(f.rbegin(),f.rend());
if((int)f.size()<=2) continue;
ll cur=0,cc=0;
cur=f[0].fi*(f[1].fi+f[2].fi);
for(int x=0;x<f.size();x++){
for(int y=x+1;y<f.size();y++){
if(f[x].fi!=f[1].fi||f[y].fi!=f[2].fi) continue;
cc+=f[x].se*f[y].se;
}
}
if(res<cur) res=cur,c=cc;
else if(res==cur) c+=cc;
}
printf("%lld %lld\n",res,c);
return 0;
}
