/* -*- coding: utf-8 -*-
 *
 * 3206.cc:  No.3206 縺・€€縺励€€縺溘€€繧ｦ縲€繝九€€譛ｨ縲€縺ゅ€€縺上€€繧薙€€隨・- yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

using ll = long long;
using vi = vector<int>;

/* global variables */

vi nbrs[MAX_N], xvs[MAX_N];
int ps[MAX_N], cis[MAX_N], ds[MAX_N];
int xds0[MAX_N], xds1[MAX_N], pds[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    u--, v--;
    nbrs[u].push_back(v);
    nbrs[v].push_back(u);
  }

  if (n <= 2) { printf("%d\n", n); return 0; }

  int rt = -1;
  for (int u = 0; u < n; u++)
    if (nbrs[u].size() >= 2) { rt = u; break; }
  
  ps[rt] = -1, ds[rt] = 0;
  for (int u = rt; u >= 0;) {
    auto &nbru = nbrs[u];
    int up = ps[u];

    if (cis[u] < nbru.size()) {
      int v = nbru[cis[u]++];
      if (v != up) {
	ps[v] = u, ds[v] = ds[u] + 1;
	u = v;
      }
    }
    else {
      if (up >= 0) {
	int xd = xds0[u] + 1;
	xvs[up].push_back(xd);
	if (xds0[up] < xd) xds1[up] = xds0[up], xds0[up] = xd;
	else if (xds1[up] < xd) xds1[up] = xd;
      }

      cis[u] = 0;
      u = up;
    }
  }

  ll maxs = 1;
  
  for (int u = rt; u >= 0;) {
    auto &nbru = nbrs[u];
    int up = ps[u];

    if (cis[u] < nbru.size()) {
      int v = nbru[cis[u]++];
      if (v != up) {
	int vd = (xds0[u] != xds0[v] + 1) ? xds0[u] : xds1[u];
	pds[v] = max(pds[u], vd) + 1;
	u = v;
      }
    }
    else {
      auto &xvu = xvs[u];
      if (pds[u] > 0) xvu.push_back(pds[u]);
      sort(xvu.begin(), xvu.end());

      int m = xvu.size();
      for (int i = 0; i < m; i++) {
	ll s = (ll)xvu[i] * (m - i) + 1;
	maxs = max(maxs, s);
      }

      cis[u] = 0;
      u = up;
    }
  }

  printf("%lld\n", maxs);
  
  return 0;
}