#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MX = 205;

vi to[MX];

P rfs(int v, int dep=0, int p=-1) {
  P res(dep,v);
  rep(i,sz(to[v])) {
    int u = to[v][i];
    if (u == p) continue;
    P r = rfs(u,dep+1,v);
    maxs(res, r);
  }
  return res;
}

int n;
vi vs;
bool rsf(int v, int tv, int p=-1) {
  vs.pb(v);
  if (v == tv) return true;
  rep(i,sz(to[v])) {
    int u = to[v][i];
    if (u == p) continue;
    if (rsf(u,tv,v)) return true;
  }
  vs.pop_back();
  return false;
}

ll solve(vi d) {
  // cerr<<d<<endl;
  vi used(n);
  ll s = sz(d);
  while (sz(d)) {
    for (int v : d) used[v] = 1;
    vi p; swap(d,p);
    int mx = 0;
    for (int v : p) {
      int cnt = 0;
      for (int u : to[v]) {
        if (used[u]) continue;
        cnt++;
        d.pb(u);
      }
      maxs(mx,cnt);
    }
    if (mx) s *= mx;
  }
  return s;
}

int main() {
  scanf("%d",&n);
  rep(i,n-1) {
    int a,b;
    scanf("%d%d",&a,&b);
    --a; --b;
    to[a].pb(b);
    to[b].pb(a);
  }

  int s = rfs(0).se;
  int t = rfs(s).se;
  // cerr<<s<<" "<<t<<endl;
  rsf(s,t);
  // cerr<<vs<<endl;
  int l = sz(vs);
  int anl = (l+1)/2;
  ll ans = LINF;
  if (l&1) {
    int c = vs[l/2];
    vi d(1,c);
    mins(ans,solve(d));
    for (int u : to[c]) {
      vi e = d;
      e.pb(u);
      mins(ans, solve(e));
    }
  } else {
    vi e = {vs[l/2-1],vs[l/2]};
    ans = solve(e);
  }

  cout<<anl<<" "<<ans<<endl;
  return 0;
}






















Measured memory_bytes: 256