#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using mint = atcoder::modint;//static_modint<(int)1e9 + 7>;
template <class F> class y_combinator {
	F f;

  public:
	y_combinator(F&& f) : f(std::forward<F>(f)) {}
	template <class... Args> auto operator()(Args &&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
template <class T> T floor(T a, T b) { return a / b - (a % b && (a ^ b) < 0); }
template <class T> T ceil(T a, T b) { return floor(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) { return (x < y ? x = y, true : false); }
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define pb push_back

void run_case() {
	int N;
	cin >> N;
	vector<vector<int>> G(N);
	rep(i, N - 1) {
		int a, b;
		cin >> a >> b;
		a--, b--;
		G[a].pb(b);
		G[b].pb(a);
	}
	vector<int> dp(N);
	y_combinator([&](auto self, int v, int p = -1) -> void {
		for(int u: G[v]) if(u != p) {
			self(u, v);
			chmax(dp[v], dp[u] + 1);
		}
	})(0);
	int ans = 0;
	y_combinator([&](auto self, int v, int p_val, int p = -1) -> void {
		const int K = G[v].size();
		vector<int> A(K);
		rep(i, K) {
			int ch = G[v][i];
			if(ch == p) A[i] = p_val;
			else A[i] = dp[ch] + 1;
		}
		vector<int> pref(K + 1), suff(K + 1);
		rep(i, K) pref[i + 1] = max(pref[i], A[i]);
		rrep(i, K - 1, -1, -1) suff[i] = max(suff[i + 1], A[i]);

		sort(rall(A));
		rep(i, K) {
			chmax<int>(ans, A[i] * (i + 1) + 1);
		}

		rep(i, K) {
			int ch = G[v][i];
			if(ch == p) continue;
			int mx = max(pref[i], suff[i + 1]) + 1;
			self(ch, mx, v);
		}
	})(0, 0);
	cout << ans << endl;
}

int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::fixed(std::cout).precision(16);
	int T = 1;
	//cin >> T;
	while(T--) run_case();
	return 0;
}