#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
template <class T>
using MaxHeap = std::priority_queue<T>;
template <class T>
using MinHeap = std::priority_queue<T, vector<T>, greater<T>>;
#define rep2(i, n) for (ll i = 0; i < (n); i++)
#define rep3(i, l, r) for (ll i = (l); i < (r); i++)
#define rrep2(i, n) for (ll i = n; i-- > 0;)
#define rrep3(i, r, l) for (ll i = (r); i-- > (l);)
#define overload(a, b, c, d, ...) d
#define rep(...) overload(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rrep(...) overload(__VA_ARGS__, rrep3, rrep2)(__VA_ARGS__)
#define all(x) begin(x), end(x)
bool chmin(auto& lhs, auto rhs) {
    return lhs > rhs ? lhs = rhs, 1 : 0;
}
bool chmax(auto& lhs, auto rhs) {
    return lhs < rhs ? lhs = rhs, 1 : 0;
}
struct IOIO {
    IOIO() {
        std::cin.tie(0)->sync_with_stdio(0);
    }
} ioio;

void solve() {
    int n;
    cin >> n;
    vector graph(n, vector<int>());
    rep(i, n - 1) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        graph[u].push_back(v);
        graph[v].push_back(u);
    }
    vector<int> H(n, 1);
    auto dfs1 = [&](auto&& self, int u, int p) -> int {
        for (auto v: graph[u]) {
            if (v == p) continue;
            int temp = self(self, v, u);
            chmax(H[u], temp + 1);
        }
        return H[u];
    };
    dfs1(dfs1, 0, -1);
    int ans = 1;
    auto dfs2 = [&](auto&& self, int u, int p, int pval) -> void {
        int m = graph[u].size();
        vector<int> res(m);
        rep(i, m) {
            int v = graph[u][i];
            if (v == p) {
                res[i] = pval;
            } else {
                res[i] = H[v];
            }
        }
        auto sorted = res;
        sort(all(sorted), greater());
        rep(i, m) {
            chmax(ans, 1 + (i + 1) * sorted[i]);
        }
        vector<int> pre(m + 1), suf(m + 1);
        rep(i, m) pre[i + 1] = max(pre[i], res[i]);
        rrep(i, m) suf[i] = max(suf[i + 1], res[i]);
        rep(i, m) {
            int v = graph[u][i];
            if (v == p) continue;
            self(self, v, u, max(pre[i], suf[i + 1]));
        }
    };
    dfs2(dfs2, 0, -1, -1);
    cout << ans << '\n';
}

int main() {
    int t = 1;
    //  cin >> t;
    while (t--) solve();
}