#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const int N = 200005;
const double PI = 4 * atan(1);
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
bool issquare(long long w) { return trunc(sqrt(w)) * trunc(sqrt(w)) == w; }
bool isprime(long long u) {
  for (long long i = 2; i <= (int)sqrt(u); i++) {
    if (u % i == 0) return 0;
  }
  return 1;
}
long long mod(long long to_mod) {
  to_mod %= MOD;
  while (to_mod < 0) to_mod += MOD;
  return to_mod % MOD;
}
long long moduloMultiplication(long long a, long long b, long long mod) {
  long long res = 0;
  a %= mod;
  while (b) {
    if (b & 1) res = (res + a) % mod;
    a = (2 * a) % mod;
    b >>= 1;
  }
  return res;
}
long long power(long long x, long long y) {
  long long res = 1;
  x = x;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
long long n, x, ans = 0, res = 0;
;
map<long long, vector<long long> > adj;
long long dist[100005];
queue<long long> q;
map<long long, long long> maa;
int main() {
  scanf("%I64d", &n);
  for (int i = 0; i < n; i++) dist[i] = 1e9;
  dist[0] = 0;
  for (int i = 0; i < n - 1; i++) {
    scanf("%I64d", &x);
    x--;
    adj[x].push_back(i + 1);
  }
  q.push(0);
  maa[0] = 1;
  while (!q.empty()) {
    long long ras = q.front();
    q.pop();
    for (auto t : adj[ras]) {
      dist[t] = dist[ras] + 1;
      maa[dist[t]]++;
      q.push(t);
    }
  }
  for (auto t : maa) {
    if (t.second % 2) ans++;
  }
  printf("%I64d", ans);
  return 0;
}
