#include <bits/stdc++.h>
#include <atcoder/all>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
namespace mp = boost::multiprecision;
using Bint = mp::cpp_int;
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int n;
vector<int> dp(2e5+5);
vector<ll> ans(2e5+5,1);
vector<vector<int>> g(2e5+5);

int dfs(int u, int p=-1) {
    int res = 1;
    for(int v : g[u]){
        if(v==p) continue;
        dfs(v,u);
        res = max(res, dp[v]+1);
    }
    return dp[u] = res;
};

void dfs2(int u, int p=-1){
    int N = g[u].size();
    if(N==0) return;
    vector<int> l(N);
    vector<int> r(N);
    vector<int> vs;
    rep(i,N){
      vs.push_back(dp[g[u][i]]);
    }
    sort(vs.begin(),vs.end());
    rep(i,N) {
      ll val = vs[i];
      ans[u] = max(ans[u], val*(N-i)+1);
    }
    l[0] = dp[g[u][0]];
    r[N-1] = dp[g[u][N-1]];
    rep(i,N){
        int v = g[u][i];
        if(i-1>=0) l[i] = max(l[i-1],(dp[v]+1));
    }
    for(int i=N-1;i>=0;i--){
        int v = g[u][i];
        if(i+1<N) r[i] = max(r[i+1],(dp[v]+1));
    }
    rep(i,N){
        int v = g[u][i];
        if(v==p) continue;
        dp[u] = 1;
        if(i-1>=0) dp[u] = max(dp[u], l[i-1]);
        if(i+1<N) dp[u] = max(dp[u], r[i+1]);
        dfs2(v, u);
    }
};

int main()
{
    cin >> n;
    rep(i,n-1){
        int u, v;
        cin >> u >> v;
        --u;--v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    dfs(0);
    dfs2(0);
    cout << *max_element(ans.begin(),ans.end()) << endl;
    return 0;
}