#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 50;

int n, fa[N];
int64_t f[N], g[N], cd[N][2], mx[N], su[N], siz[N];

void upd(int64_t *f, int64_t z) {
	if (f[0] < z)
		f[1] = f[0], f[0] = z;
	else if (f[1] < z)
		f[1] = z;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	cin >> n;
	for (int i = 2; i <= n; ++i) {
		cin >> fa[i];
	}
	for (int i = n; i >= 1; --i) {
		++siz[i];
		siz[fa[i]] += siz[i];
	}
	for (int i = n; i >= 1; --i) {
		f[i] = su[i] + 2 * siz[i] - max(cd[i][0] + cd[i][1], 2 * mx[i]);
		g[i] = su[i] - cd[i][0] + siz[i];
		su[fa[i]] += f[i];
		upd(cd[fa[i]], f[i] + siz[i] - g[i]);
		mx[fa[i]] = max(mx[fa[i]], siz[i]);
	}
	cout << f[1] << '\n';
}