#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

int main() {
  int n;
  cin >> n;
  vector<vector<int>> G(n);
  rep(i,0,n-1) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    G[u].eb(v), G[v].eb(u);
  }
  vector<vector<int>> sl(n), sr(n);
  function<int(int,int)> dfs = [&](int v, int pv) {
    if (pv != -1) G[v].erase(find(all(G[v]), pv));
    sl[v].resize(len(G[v])+1), sr[v].resize(len(G[v])+1);
    rep(i,0,len(G[v])) {
      sl[v][i+1] = dfs(G[v][i], v)+1;
      sr[v][i] = sl[v][i+1];
    }
    rep(i,0,len(G[v])) sl[v][i+1] = max(sl[v][i+1], sl[v][i]);
    rrep(i,len(G[v]),0) sr[v][i] = max(sr[v][i+1], sr[v][i]);
    return sl[v].back();
  };
  dfs(0, -1);
  vector<int> val(n);
  function<void(int,int)> dfs2 = [&](int v, int x) {
    val[v] = x;
    rep(i,0,len(G[v])) {
      dfs2(G[v][i], max(x, max(sl[v][i], sr[v][i+1]))+1);
    }
  };
  dfs2(0, 0);
  // rep(i,0,n) {
  //   cout << sl[i].back() << " ";
  // }
  // cout << endl;
  // rep(i,0,n) {
  //   cout << val[i] << " ";
  // }
  // cout << endl;
  int ans = 0;
  rep(i,0,n) {
    vector<int> x;
    x.eb(val[i]);
    for (int nv : G[i]) x.eb(sl[nv].back()+1);
    sort(rall(x));
    rep(j,0,len(x)) {
      // cout << x[j] << " ";
      ans = max(ans, x[j]*(j+1)+1);
    }
    // cout << endl;
  }
  cout << ans << endl;
  return 0;
}