/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author majk
 */

#ifndef MAJK_LIB
#define MAJK_LIB

#include <vector>
#include <stack>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <fstream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <string>
#include <sstream>
#include <queue>
#include <bitset>
using namespace std;

#define x first
#define y second
typedef std::pair<int,int> pii; typedef long long ll; typedef unsigned long long ull; typedef unsigned int ui; typedef pair<ui,ui> puu;

template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.x >> p.y; return i;}
template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template <typename T, typename U> std::ostream&operator<<(std::ostream&o, const pair<T,U>&p) {o << p.x << ' ' << p.y; return o;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {if(t.empty())o<<'\n';for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}
template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;
template <typename T> bool in(T a, T b, T c) { return a <= b && b < c; }
ui logceil(int x) { return 8*sizeof(int)-__builtin_clz(x); }

namespace std { template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}}; }
template<typename T,typename F>T bsh(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){l=m+1;r=m;}else{h=m-1;}}return r;}
template<typename F> double bshd(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){l=m;}else{h=m;}}return (l+h)/2;}
template<typename T,typename F>T bsl(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){h=m-1;r=m;}else{l=m+1;}}return r;}
template<typename F> double bsld(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){h=m;}else{l=m;}}return (l+h)/2;}
template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }

template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};
template<typename T>class vector3:public vector<vector2<T>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector2<T>>(a,vector2<T>(b,c,t)){}};
template<typename T>class vector4:public vector<vector3<T>>{public:vector4(){} vector4(size_t a,size_t b,size_t c,size_t d,T t=T()):vector<vector3<T>>(a,vector3<T>(b,c,d,t)){}};
template<typename T>class vector5:public vector<vector4<T>>{public:vector5(){} vector5(size_t a,size_t b,size_t c,size_t d,size_t e,T t=T()):vector<vector4<T>>(a,vector4<T>(b,c,d,e,t)){}};


#endif
// #include "../l/mod.h"

class D {
public:
    int N;
    vector<vector<int>> E;

    vector<int> bfs(int u) {
        vector<int> D(N, -1);
        vector<int> Q{u};
        D[u] = 0;
        for (int i = 0; i < N; ++i) {
            int q = Q[i];
            for (int v:E[q]) {
                if (D[v] == -1) {
                    D[v] = D[q] + 1;
                    Q.push_back(v);
                }
            }
        }
        return D;
    }

    void dfs(int u, int p, int d, vector<int> &M) {
        M[d] = max(M[d], (int)E[u].size() - (p!=-1));
        for (int v:E[u]) if (v != p) dfs(v, u, d+1, M);
    }

    ll getAns(const vector<int>&U) {
        ll ans = 1;
        for (int u:U) ans *= u;
        return ans;
    }


    void solve(istream& cin, ostream& cout) {
        cin >> N;
        E.resize(N);
        for (int i = 0; i < N-1; ++i) {
            int u, v;
            cin >> u >> v;
            --u;
            --v;
            E[u].push_back(v);
            E[v].push_back(u);
        }


        vector<int> D = bfs(0);
        pii l{0,0};
        for (int i = 0; i < N; ++i) l = max(l, {D[i],i});

        int source = l.y;
        D = bfs(l.y);
        l = {0,0};
        for (int i = 0; i < N; ++i) l = max(l, {D[i],i});

        int target = l.y;
        auto D2 = bfs(l.y);
//        cout << source+1 << ' ' << target+1 << ' ' << l.x << endl;

        vector<int> C;
        for (int i = 0; i < N; ++i) {
            if (D[i] + D2[i] == l.x && D[i] >= l.x/2 && D2[i] >= l.x/2) {
                C.push_back(i);
            }
        }

        ll ans = 0;
        vector<int> U(l.x/2+1, 1);
        if (C.size() == 1) {
            dfs(C[0], -1, 0, U);
            ans = getAns(U);

            for (int v:E[C[0]]) {
                U = vector<int>(l.x/2+1, 1);
                dfs(C[0], v, 0, U);
                dfs(v, C[0], 0, U);
                ans = min(2*getAns(U), ans);
            }
        } else {
            dfs(C[0], C[1], 0, U);
            dfs(C[1], C[0], 0, U);
            ans = 2*getAns(U);
        }
        cout << l.x/2 + 1 << ' ' << ans << endl;
    }
};


int main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	D solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
    return 0;
}


Measured memory_bytes: 256