#include <bits/stdc++.h>

using namespace std;
const int c=1000005;
long long ans;
int n, koz, si[c], db[c];
vector<int> sz[c];
bitset<c> dp;
void dfs(int a) {
    si[a]=1;
    int maxi=0;
    for (auto x:sz[a]) {
        dfs(x);
        maxi=max(maxi, si[x]);
        si[a]+=si[x];
    }
    if (!koz && 2*si[a]>=n) {
        for (auto x:sz[a]) {
            db[si[x]]++;
        }
        if (a!=1) {
            db[n-si[a]]++;
        }
        ans+=n;
        koz=a;
    } else {
        ans+=min(si[a], n-maxi);
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin >> n;
    for (int i=2; i<=n; i++) {
        int x;
        cin >> x;
        sz[x].push_back(i);
    }
    dfs(1);
    dp[0]=1;
    for (int i=1; i<=n; i++) {
        while (db[i]>=3) {
            db[2*i]++;
            db[i]-=2;
        }
        for (int j=1; j<=db[i]; j++) {
            //cout << "fontos " << i << "\n";
            dp|=(dp<<i);
        }
    }
    for (long long ert=n/2; ert<=n; ert++) {
        if (dp[ert]) {
            ans+=ert*(n-1-ert);
            break;
        }
    }
    cout << ans << "\n";
    return 0;
}