#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

void dfs(vector<vector<ll>> &graph, vector<bool> &isvisited, ll v,
         vector<vector<ll>> &depth, vector<ll> &depth_max) {
    isvisited[v] = true;
    for (ll i = 0; i < graph[v].size(); i++) {
        if (isvisited[graph[v][i]]) {
            continue;
        }
        dfs(graph, isvisited, graph[v][i], depth, depth_max);
        depth[v][i] = depth_max[graph[v][i]] + 1;
    }
    for (ll i = 0; i < graph[v].size(); i++) {
        depth_max[v] = max(depth_max[v], depth[v][i]);
    }
}

int main() {
    ll N;
    cin >> N;
    vector<ll> u(N - 1);
    vector<ll> v(N - 1);
    for (ll i = 0; i < N - 1; i++) {
        cin >> u[i] >> v[i];
        u[i]--;
        v[i]--;
    }
    vector graph(N, vector<ll>(0));
    for (ll i = 0; i < N - 1; i++) {
        graph[u[i]].push_back(v[i]);
        graph[v[i]].push_back(u[i]);
    }
    vector depth(N, vector<ll>(0));
    vector<ll> depth_max(N);
    for (ll i = 0; i < N; i++) {
        for (ll j = 0; j < graph[i].size(); j++) {
            depth[i].push_back(0);
        }
    }
    vector<bool> isvisited(N, false);
    dfs(graph, isvisited, 0, depth, depth_max);

    // debug(depth);
    // debug(depth_max);

    // 残りは全て BFS で求める
    vector left_max(N, vector<ll>(0));
    vector right_max(N, vector<ll>(0));
    for (ll i = 0; i < N; i++) {
        for (ll j = 0; j < graph[i].size(); j++) {
            left_max[i].push_back(0);
            right_max[i].push_back(0);
        }
    }
    queue<ll> que;
    que.push(0);
    vector<ll> prev(N, -1);

    while (que.size()) {
        ll p = que.front();
        que.pop();

        ll len = graph[p].size();
        // pop のタイミングで、自分のいる頂点に対する処理を行う
        left_max[p][0] = depth[p][0];
        right_max[p][len - 1] = depth[p][len - 1];
        for (ll i = 0; i < len; i++) {
            left_max[p][i] = max(left_max[p][i], depth[p][i]);
        }
        for (ll i = len - 1; i >= 0; i--) {
            right_max[p][i] = max(right_max[p][i], depth[p][i]);
        }

        for (ll i = 0; i < len; i++) {
            ll x = graph[p][i];
            if (prev[p] == x) {
                ll next;
                if (graph[x].size() == 1) {
                    next = 1;
                } else {
                    if (i == 0) {
                        next = right_max[x][i + 1];
                    } else if (i == graph[x].size() - 1) {
                        next = left_max[x][i - 1];
                    } else {
                        next = max(left_max[x][i - 1], right_max[x][i + 1]);
                    }
                }
                // 次の頂点番号を参照する
                depth[p][i] = next;
                continue;
            }
            que.push(x);
            prev[x] = p;
        }
    }
    ll ans = 0;
    for (ll i = 0; i < N; i++) {
        vector<ll> vecs(0);
        for (ll j = 0; j < graph[i].size(); j++) {
            vecs.push_back(depth[i][j]);
        }
        sort(all(vecs));
        ll len = vecs.size();
        ll cur_max = vecs[len - 1];
        for (ll j = len - 1; j >= 0; j--) {
            cur_max = min(cur_max, vecs[j]);
            ans = max(ans, cur_max * (len - j) + 1);
        }
    }
    cout << ans << endl;
}