#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',')cerr<<*sdbg++; cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define cerr if(0)cout
#endif
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
template<class T> void ResizeVec(T&, vector<int>) {}
template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
  vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
  for (T& v : vec) { ResizeVec(v, sz); }
}
typedef Triple<int, int, int> TIII;
template<class A, class B, class C>
ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class T> ostream& operator<<(ostream& out, set<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class L, class R> ostream& operator<<(ostream& out, map<L, R> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }

const int N = 1e6 + 5;
VI slo[N];
void RemEdge(int a, int b) {
  REP (tr, 2) {
    REP (i, SZ(slo[a])) {
      if (slo[a][i] == b) {
        swap(slo[a][i], slo[a].back());
        slo[a].pop_back();
        break;
      }
    }
    swap(a, b);
  }
}
int multuj[N];
int Dfs(int v, int p, int dis) {
  //debug(v, p);
  int m_dis = dis;
  maxi(multuj[dis], SZ(slo[v]) - (p != -1));
  for (auto nei : slo[v]) {
    if (nei == p) { continue; }
    maxi(m_dis, Dfs(nei, v, dis + 1));
  }
  return m_dis;
}
int n;
int GetLeaves() {
  int leaves = 1;
  REP (i, n + 1) {
    debug(i, multuj[i]);
    leaves *= max(1ll, multuj[i]);
  }
  return leaves;
}
void AddEdge(int a, int b) {
  slo[a].PB(b);
  slo[b].PB(a);
}
int32_t main() {

  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  cerr << fixed << setprecision(10);
  cin.tie(0);
  //double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
  

  cin>>n;
  RE (i, n - 1) {
    int a, b;
    cin>>a>>b;
    slo[a].PB(b);
    slo[b].PB(a);
  }
  PII best = {n, n};
  RE (i, n) {
    REP (j, n + 1) {
      //vis[j] = 0;
      multuj[j] = 0;
    }
    int cols = Dfs(i, -1, 0) + 1;
    int leaves = GetLeaves();
    PII cand = {cols, leaves};
    mini(best, cand);
    debug(i, cand);
  }
  debug(best);
  RE (i, n) {
    VI cp = slo[i];
    for (auto nei : cp) {
      REP (j, n + 1) {
        //vis[j] = 0;
        multuj[j] = 0;
      }
      if (nei < i) { continue; }
      RemEdge(nei, i);
      AddEdge(n + 1, nei);
      AddEdge(n + 1, i);
      int cols = Dfs(n + 1, -1, 0);
      int leaves = GetLeaves();
      PII cand = {cols, leaves};
      mini(best, cand);
      debug(i, nei, cand);
      RemEdge(n + 1, nei);
      RemEdge(n + 1, i);
      AddEdge(nei, i);
    }
  }
  cout<<best.st<<" "<<best.nd<<endl;
      
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  return 0;
}


Measured memory_bytes: 25344