// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

vector<int> path;
int st, en;

template <typename T>
struct edge{
  int from, to;
  T w;
  edge(){}
  edge(int from, int to, T w): from(from), to(to), w(w){}
};

template <typename T>
struct Tree{
  int n = 0;
  vector<vector<edge<T>>> edges;
  vector<T> dis;
  Tree(){}
  explicit Tree(int n): n(n){
    edges.resize(n);
    dis.resize(n);
  }
  void adde(int from, int to, T cost){
    edges[from].emplace_back(from, to, cost);
  }
  void dfs(int i){
    for(auto e: edges[i]){
      if(dis[e.to] == -1){
        dis[e.to] = dis[i] + e.w;
        dfs(e.to);
      }
    }
  }
  T diameter(){
    dis.assign(n, -1);
    dis[0] = 0;
    dfs(0);
    int at = 0;
    T maxi = -1;
    for(int i = 0; i < n; i++){
      if(maxi < dis[i]){
        maxi = dis[i];
        at = i;
      }
    }
    dis.assign(n, -1);
    dis[at] = 0;
    dfs(at);
    st = at;
    T res = -1;
    for(int i = 0; i < n; i++){
      if(res < dis[i]){
        res = dis[i];
        en = i;
      }
    }
    return res;
  }
};
vector<int> edges[101];

bool dfs(int i, int g, int p){
  path.pb(i);
  if(i == g)return true;
  for(auto e: edges[i]){
    if(e == p)continue;
    bool b = dfs(e, g, i);
    if(b)return true;
  }
  path.pop_back();
  return false;
}

struct ed{
  int i, p, h;
  ed(int i, int p, int h): i(i), p(p), h(h){}
};

ll calc(int u, int v){
  vector<ll> deg;
  queue<ed> q;
  q.push(ed(u, v, 0));
  q.push(ed(v, u, 0));
  while(!q.empty()){
    auto p = q.front(); q.pop();
    if(sz(deg) <= p.h)deg.pb(1);
    chmax(deg[p.h], (ll)sz(edges[p.i]) - 1);
    for(auto e: edges[p.i]){
      if(e == p.p)continue;
      q.push(ed(e, p.i, p.h + 1));
    }
  }
  ll res = 1;
  for(auto d: deg)res *= d;
  return res;
}

ll calc2(int u){
  vector<ll> deg;
  queue<ed> q;
  q.push(ed(u, -1, 0));
  while(!q.empty()){
    auto p = q.front(); q.pop();
    if(sz(deg) <= p.h)deg.pb(1);
    if(p.i != u)chmax(deg[p.h], (ll)sz(edges[p.i]) - 1);
    else chmax(deg[p.h], (ll)sz(edges[p.i]));
    for(auto e: edges[p.i]){
      if(e == p.p)continue;
      q.push(ed(e, p.i, p.h + 1));
    }
  }
  ll res = 1;
  for(auto d: deg)res *= d;
  return res;
}

int main(int argc, char const* argv[])
{
  int n; cin >> n;
  Tree<int> t(n);
  rep(i, n - 1){
    int a, b; cin >> a >> b, a--; b--;
    t.adde(a, b, 1);
    t.adde(b, a, 1);
    edges[a].pb(b);
    edges[b].pb(a);
  }
  int D = t.diameter();
  ll C = linf;
  dfs(st, en, -1);
  if(sz(path) % 2 == 0){
    C = calc(path[sz(path)/2-1], path[sz(path)/2]) * 2;
  }else{
    C = calc2(path[sz(path)/2]);
    for(auto e: edges[path[sz(path)/2]]){
      chmin(C, calc(path[sz(path)/2], e) * 2);
    }
  }
  cout << (D + 2) / 2 << " " << C << endl;;
  return 0;
}


Measured memory_bytes: 256