#include <bits/stdc++.h>
    
using namespace std;
    
typedef long long ll;
const int  N = 1e6 + 12, MOD = (int)1e9 + 7;

vector<int> g[N];
int s[N], n;
ll ans = 0, dp[N][2];
void calc(int v) {
    s[v] = 1;
    int b = 0, b1 = 0;
    for(int to:g[v]) {
        calc(to);
        s[v] += s[to];
        if(s[to] > b) {
            b1 = b;
            b = s[to];
        } else if(s[to] > b1) {
            b1 = s[to];
        }
        dp[v][0] += dp[to][0];
    }
    dp[v][0] += b;
    dp[v][1] = dp[v][0] + b1;
    ans += s[v] * 2;
}
void test() {
    cin >> n;
    for(int i = 2; i <= n; i++) {
        int p;
        cin >> p;
        g[p].push_back(i);
    }
    calc(1);
    cout << ans - max(dp[1][0], dp[1][1]) * 2 << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); 
    
    int t = 1; 
    // cin >> t;
    
    while(t--) 
        test();
    return 0;
}