// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")


#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;(i)<(n);(i)++)
#define REP(i,a,n) for(ll i=(a);(i)<(n);(i)++)
#define rrep(i,n) for(ll i=(n)-1;(i)>=(0ll);(i)--)
#define RREP(i,a,n) for(ll i=(n)-1;(i)>=(a);(i)--)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define be(v) (v).begin(),(v).end()
#define all(v) (v).begin(),(v).end()
#define foa(i,v) for(auto& (i) : (v))
#define UQ(v) sort(be(v)), (v).erase(unique(be(v)), (v).end())
#define UQ2(v,cmp) sort(be(v)), (v).erase(unique(be(v),cmp), (v).end())
#define UQ3(v,cmp) sort(be(v),cmp), (v).erase(unique(be(v)), (v).end())
#define UQ4(v,cmp,cmp2) sort(be(v), cmp), (v).erase(unique(be(v),cmp2), (v).end())
#define LB(x,v) (lower_bound(be(v),(x))-(v).begin())
#define LB2(x,v,cmp) (lower_bound(be(v),(x),(cmp))-(v).begin())
#define UB(x,v) (upper_bound(be(v),(x))-(v).begin())
#define UB2(x,v,cmp) (upper_bound(be(v),(x),(cmp))-(v).begin())
#define dout()  cout << fixed << setprecision(20)
#define randinit() srand((unsigned)time(NULL))

template<class T, class U> bool chmin(T& t, const U& u) { if (t > u){ t = u; return 1;} return 0; }
template<class T, class U> bool chmax(T& t, const U& u) { if (t < u){ t = u; return 1;} return 0; }


ll Rnd(ll L=0, ll R=mod99){return rand()%(R-L)+L;}



void solve(){
	ll n;
	cin >> n;
	VV<ll> G(n);
	rep(i,n-1){
		ll u,v;
		cin >> u >> v;
		u--;
		v--;
		
		G[u].eb(v);
		G[v].eb(u);
	}
	V<ll> depth(n, 0);
	ll ans = 2;
	auto dfs = [&](auto&&dfs, ll nd, ll par) -> void {
	   // cout << nd << " " << par << endl;
		for(auto nx:G[nd]) if(nx != par){
			dfs(dfs, nx, nd);
			chmax(depth[nd], depth[nx]+1);
		}
	};
	auto dfs2 = [&](auto&&dfs, ll nd, ll par, ll x) -> void {
	   // cout << nd << " " << par << " " << x << endl;
		V<ll> vv = {x};
		for(auto nx:G[nd]) if(nx != par) vv.eb(depth[nx]+1);
		vv.eb(x);
		V<ll> L = vv, R = vv;
		REP(i,1,L.size()) chmax(L[i], L[i-1]);
		for(ll i=R.size()-2; i>=0;i--) chmax(R[i], R[i+1]);
		
		ll cnt = 1;
		for(auto nx:G[nd]) if(nx != par){
			dfs(dfs, nx, nd, max(L[cnt-1], R[cnt+1])+1);
			cnt++;
		}
		vv.pop_back();
		sort(be(vv));
		reverse(be(vv));
		ll a = 0;
		rep(i, vv.size()) chmax(ans, vv[i]*(i+1)+1);
// 		cout << nd << " " << a << endl;
	};
	dfs(dfs, 0, -1);
	dfs2(dfs2, 0, -1, 0);
	cout << ans << endl;
    
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t=1;
    // cin >> t;
    rep(i,t) solve();
}