#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int Nmax = 1e6 + 5;
vector<int> v[Nmax];

int w[Nmax], level[Nmax];
ll sum_levels;
ll ans = 0;
int n;

int rem[Nmax/2];
bool marked[Nmax/2];



void dfs(int node)
{
    w[node] = 1;
    sum_levels += level[node];

    for(auto it : v[node])
    {
        level[it] = level[node] + 1;
        dfs(it);
        w[node] += w[it];
    }
}

ll knapsack_brute(vector<int> &v, int lim)
{
    vector<bool> marked(lim+1);
    marked[0] = 1;

    for(auto it : v)
        for(int i = lim - it; i>=0; --i)
            if(marked[i])
                marked[i+it] = 1;

    for(int i=lim; i>=0; --i)
        if(marked[i]) return i;
    return 0;
}

ll knapsack(vector<int> &v, int lim)
{
    sort(v.begin(), v.end());

    if(v.back() >= n/2)
        return n-1-v.back();

    vector<pair<int,int>> uniques;
    int last = -1;

    for(auto it : v)
        if(it == last) uniques.back().second ++;
        else
        {
            last = it;
            uniques.push_back({last, 1});
        }

    memset(marked, 0, sizeof(marked));
    marked[0] = 1;

    for(auto it : uniques)
    {
        int val = it.first;
        int occ = it.second;

        for(int i=0; i<=lim; ++i)
            if(marked[i]) rem[i] = occ;
            else rem[i] = 0;

        for(int i=0; i+val<=lim; ++i)
        {
            if(!marked[i+val] && rem[i])
            {
                marked[i+val] = 1;
                rem[i+val] = rem[i] - 1;
            }
        }
    }

    for(int i=lim; i>=0; --i)
        if(marked[i]) return i;
    return 0;
}

void dfs2(int node, ll subtract = 0)
{
    ll now = sum_levels + (ll) (level[node] - 1) * n - 2 * subtract;

    vector<int> wcomp;
    for(auto it : v[node])
        wcomp.push_back(w[it]);
    wcomp.push_back(n - w[node]);

    ll k = knapsack(wcomp, (n-1)/2);

    now += (ll) k * (n-1-k);

    if(now > ans) ans = now;

    for(auto it : v[node])
        dfs2(it, subtract + w[it]);
}

int main()
{
    cin.tie(0); cin.sync_with_stdio(false);

    cin >> n;
    for(int i=2; i<=n; ++i)
    {
        int x;
        cin >> x;
        v[x].push_back(i);
    }

    level[1] = 1;

    dfs(1);
    dfs2(1);

    cout << ans << '\n';

    return 0;
}