using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var map = NMap(n - 1);
        var tree = new List<Edge>[n];
        for (var i = 0; i < n; ++i) tree[i] = new List<Edge>();
        foreach (var edge in map)
        {
            tree[edge[0]].Add(new Edge(edge[1]));
            tree[edge[1]].Add(new Edge(edge[0]));
        }
        DFS(0, -1, tree);
        var ans = 0L;
        DFS2(0, -1, 0, tree, ref ans);
        WriteLine(ans);
    }
    class Edge
    {
        public int To;
        public int Len;
        public Edge(int to)
        {
            To = to;
        }
    }
    static int DFS(int cur, int prev, List<Edge>[] tree)
    {
        var ans = 0;
        foreach (var next in tree[cur])
        {
            if (next.To == prev) continue;
            next.Len = DFS(next.To, cur, tree);
            ans = Math.Max(ans, next.Len);
        }
        return ans + 1;
    }
    static void DFS2(int cur, int prev, int upper, List<Edge>[] tree, ref long ans)
    {
        var list = new List<Edge>(tree[cur].Count);
        foreach (var next in tree[cur])
        {
            if (next.To == prev) next.Len = upper + 1;
            list.Add(next);
        }
        list.Sort((l, r) => r.Len.CompareTo(l.Len));
        var sub = 0L;
        for (var i = 0; i < list.Count; ++i) sub = Math.Max(sub, (long)list[i].Len * (i + 1) + 1);
        ans = Math.Max(ans, sub);
        foreach (var next in tree[cur])
        {
            if (next.To == prev) continue;
            DFS2(next.To, cur, tree[cur].Count == 1 ? 0 : next.To == list[0].To ? list[1].Len : list[0].Len, tree, ref ans);
        }
    }
}