#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
template <typename Data, Data(*e)(), Data(*addEdge)(const Data&, int)
	, Data(*addVertex)(const Data&, int), Data(*merge)(const Data&, const Data&)>
	class ReRooting {
	public:
		ReRooting(int size) :size(size) {
			edges.resize(size);
		}

		void setEdge(int s, int t, int index) {
			edges[s].emplace_back(s, t, index);
			edges[t].emplace_back(t, s, index);
		}

		std::vector<Data>execute() {
			sdp.resize(size);
			dfs(0, -1);

			rep(i, size) {
				cout << sdp[i] << "_";
			}cout << endl;
			dp.resize(size);
			//	dp = sdp;
			dfsR(0, -1);
			return dp;
		}
	private:
		struct Edge {
			int from, to;
			int index;
			Edge(int from, int to, int index) :from(from), to(to), index(index) {}
		};

		int size;
		std::vector<std::vector<Edge>>edges;
		std::vector<Data>sdp, dp;

		void dfs(int v, int p = -1) {
			auto val = e();
			for (Edge &edge : edges[v]) {
				if (p == edge.to)continue;
				dfs(edge.to, v);
				val = merge(val, addEdge(sdp[edge.to], edge.index));
			}
			sdp[v] = addVertex(val, v);
		}

		void dfsR(int v, int p = -1) {
			std::vector<Data>tmp;
			for (Edge &edge : edges[v]) {
				tmp.push_back(addEdge(sdp[edge.to], edge.index));
			}
			int n = tmp.size();
			std::vector<Data> head(n + 1, e()), tail(n + 1, e());
			for (int i = 0; i++ < n;) head[i] = merge(head[i - 1], tmp[i - 1]);
			for (int i = n; i-- > 0;) tail[i] = merge(tail[i + 1], tmp[i]);
			//dp[v] = addVertex(head[n], v);
			int index = 0;
			for (Edge &edge : edges[v]) {
				if (p != edge.to) {
					sdp[v] = addVertex(merge(head[index], tail[index + 1]), v);
					dp[edge.to] = sdp[v] + 1;
					dfsR(edge.to, v);
				}
				index++;
			}
		}
};
// sumple
// AtCoder Regular Contest 179-D
// https://atcoder.jp/contests/arc179/submissions/55004700
// AtCoder Beginner Contest 394-F
// https://atcoder.jp/contests/abc394/submissions/63045664
using Data = int;
Data e() {
	return 0;
}
Data addEdge(const Data &x, int edgeIndex) {
	return x + 1;
}
Data addVertex(const Data &x, int vertexIndex) {
	return x;
}
Data merge(const Data &l, const Data&r) {
	return max(l, r);
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	ReRooting<Data, e, addEdge, addVertex, merge> reroot(n);
	vector to(n, vector<int>());
	rep(i, n - 1) {
		int u, v; cin >> u >> v;
		u--, v--;
		reroot.setEdge(u, v, i);
		to[u].push_back(v);
		to[v].push_back(u);
	}
	auto get = reroot.execute();
	vector tmp(n, vector<int>());
	auto dfs = [&](auto &&self, int v, int p = -1)->int {
		int ret = 0;
		for (auto nv : to[v]) {
			if (p == nv)continue;
			auto x = self(self, nv, v) + 1;
			tmp[v].push_back(x);
			chmax(ret, x);
		}
		if (p != -1)tmp[v].push_back(get[v]);
		return ret;
	};
	dfs(dfs, 0);
	long long ans = 0;
	rep(i, n) {
		sort(allR(tmp[i]));
		rep(j, tmp[i].size()) {
			long long x = 1LL + ((long long)j + 1) * tmp[i][j];
			chmax(ans, x);
		}
	}
	cout << ans << endl;
	//rep(i, n) cout << get[i] << endl;
	return 0;
}