#include <functional>
#include <list>
#include <string>
#include <vector>
#include <climits>
#include <cstring>
#include <map>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <deque>
#include <stack>
#include <cassert>
using namespace std;
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define ALL(x) (x).begin(),(x).end()
#define CASET2 int ___T, case_n = 1; scanf("%d ", &___T); while ((___T > 0 ? printf("Case #%d:\n", case_n++) : 0), ___T-- > 0)
#define CASET1 int ___T, case_n = 1; scanf("%d ", &___T); while ((___T > 0 ? printf("Case #%d: ", case_n++) : 0), ___T-- > 0)
#define CASET int ___T; scanf("%d ", &___T); while (___T-- > 0)
#define SZ(X) ((int)(X).size())
#define LEN(X) strlen(X)
#define REP(i,n) for(int i=0;i<int(n);i++)
#define REP1(i,a,b) for(int i=(a);i<=int(b);i++)
#define PER1(i,a,b) for(int i=(a);i>=(b);i--)
#define REPL(i,x) for(int i=0;x[i];i++)
#define PER(i,n) for(int i=(n)-1;i>=0;i--)
#define RI1(x) scanf("%d",&x)
#define RI2(x,y) RI1(x), RI1(y)
#define RI3(x,y...) RI1(x), RI2(y)
#define RI4(x,y...) RI1(x), RI3(y)
#define RI5(x,y...) RI1(x), RI4(y)
#define RI6(x,y...) RI1(x), RI5(y)
#define GET_MACRO(_1, _2, _3, _4, _5, _6, NAME, ...) NAME
#define RI(argv...) GET_MACRO(argv, RI6, RI5, RI4, RI3, RI2, RI1)(argv)
#define DRI(argv...) int argv;RI(argv)
#define WRI(argv...) while (RI(argv) != EOF)
#define DWRI(x...) int x; WRI(x)
#define RS(x) scanf("%s",x)
#define MP make_pair
#define PB push_back
#define MS0(x) memset(x,0,sizeof(x))
#define MS1(x) memset(x,-1,sizeof(x))
#define X first
#define Y second
#define V(x) vector<x >

typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef long long LL;
const int INF = 1000000000;

void print(int i) { printf("%d", i); }
void print(LL i);
template<class T> void PI(T i) { print(i); puts(""); }
template<class T> void PIS(T i) { print(i); printf(" "); }

template<class T>
void PV(T const &v, int N) {
    REP(i, N) {
        print(v[i]);
        printf("%c", i == N-1 ? '\n' : ' ');
    }
}

template<class T> void PV(T const &v) { PV(v, SZ(v)); }

template<class T, class S> bool has_bit(T mask, S i) { return (mask >> i) & 1; }
long long shift(int i) { return 1ll << i; }

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); }
int popcount(int x) { return __builtin_popcount(x); } 
int popcount(long long x) { return __builtin_popcountll(x); } 

#include <unordered_set>
#include <unordered_map>
#define EB emplace_back
#define RL(x) scanf("%lld", &(x))
#define PL(x) printf("%lld\n", x)
#define DRL(x) LL x; RL(x)

V(VI) adj;
PII deepest;
VI parent;

void dfs(int u, int p, int d) {
    parent[u] = p;
    deepest = max(deepest, MP(d, u));
    for (int v : adj[u]) {
        if (v != p) dfs(v, u, d+1);
    }
}

VI branches;

void dfs2(int u, int p, int d) {
    int b = 0;
    for (int v: adj[u]) {
        if (v != p) {
            b++;
            dfs2(v, u, d+1);
        }
    }
    branches[d] = max(branches[d], b);
}

VI height;
void dfs3(int u, int p) {
    for (int v : adj[u]) {
        if (v != p) {
            dfs3(v, u);
            height[u] = max(height[u], 1 + height[v]);
        }
    }
}

int main() {
    int N;
    RI(N);
    adj.resize(N+1);
    parent.resize(N+1);
    height.resize(N+1);
    REP(i, N-1) {
        DRI(a, b);
        adj[a].PB(b);
        adj[b].PB(a);
    }
    dfs(1, 0, 0);
    int a = deepest.Y;
    deepest = MP(-1, 0);
    dfs(a, 0, 0);
    int d = deepest.X, b = deepest.Y, m = b;
    REP(i, (d-1)/2) {
        // One before the centroid
        m = parent[m];
    }
    unsigned long long ans = ULLONG_MAX;
    auto update = [&ans](unsigned long long prod) {
        for (int br : branches) {
            if (br == 0) break;
            prod *= br;
        }
        ans = min(ans, prod);
    };
    if (d % 2) {
        branches = VI(N+1);
        dfs2(m, parent[m], 0);
        dfs2(parent[m], m, 0);
        update(2);
    } else {
        branches = VI(N+1);
        m = parent[m];
        dfs2(m, 0, 0);
        update(1);

        dfs3(m, 0);
        for (int ch : adj[m]) {
            branches = VI(N+1);
            dfs2(m, ch, 0);
            dfs2(ch, m, 0);
            update(2);
        }
    }
    printf("%d %llu\n", d/2 + 1, ans);
    return 0;
}


Measured memory_bytes: 256