#include <bits/stdc++.h>
using namespace std;
template<typename T = int> vector<T> create(size_t n){ return vector<T>(n); }
template<typename T, typename... Args> auto create(size_t n, Args... args){ return vector<decltype(create<T>(args...))>(n, create<T>(args...)); }
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	vector<vector<int>> to(n);
	for(int i = 1; i < n; i++){
		int p;
		cin >> p;
		p--;
		to[p].push_back(i);
	}
	struct state {
		int change, first, second;
	};
	function<state(int)> dfs = [&](int u){
		if(to[u].size() == 0){
			state now;
			now.change = 1;
			now.first = 1;
			now.second = 0;
			return now;
		}
		int f = 1, s = 0;
		vector<state> unchanged, changed;
		for(auto v : to[u]){
			state nxt = dfs(v);
			if(!nxt.change){
				if(nxt.second >= nxt.first){
					f += nxt.first;
					s += nxt.second;
				} else {
					unchanged.push_back(nxt);
				}
			} else {
				changed.push_back(nxt);
			}
		}
		if(changed.size() & 1){
			for(auto nxt : unchanged){
				f += nxt.second;
				s += nxt.first;
			}
		} else {
			for(auto nxt : unchanged){
				s += nxt.second;
				f += nxt.first;
			}
		}
		sort(changed.begin(), changed.end(), [&](state a, state b){
			return a.first - a.second > b.first - b.second;
		});
		reverse(changed.begin(), changed.end());
		int len = changed.size();
		for(int i = 0; i < len; i++){
			if(i % 2 == 1){
				s += changed[i].first;
				f += changed[i].second;
			} else {
				s += changed[i].second;
				f += changed[i].first;
			}
		}
		state now;
		now.change = (changed.size() + 1) & 1;
		now.first = f;
		now.second = s;
		return now;
	};
	cout << dfs(0).first << '\n';
	return 0;
}

#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define bn(x) ((1<<(x))-1)
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T> >;
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using P = pair<int,int>;
using T3 = tuple<int,int,int>;
using vi = vc<int>;
using vvi = vv<int>;
using vl = vc<ll>;
using vp = vc<P>;
using vt = vc<T3>;
int getInt(){int x;scanf("%d",&x);return x;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vc<T>&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
vc<string> split(const string& s,char d=' '){vc<string> r(1);for(char c:s)if(c==d)r.pb("");else r.back()+=c;return r;}
string operator*(const string& s,int t){return join(vc<string>(t,s));}
template<typename T>bool mins(T& x,const T&y){if(x>y){x=y;return true;}else return false;}
template<typename T>bool maxs(T& x,const T&y){if(x<y){x=y;return true;}else return false;}
template<typename T>T dup(T x, T y){return (x+y-1)/y;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>void uni(vc<T>& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

// linear sieve
vi ps, pf;
void sieve(int mx) {
  pf = vi(mx+1);
  rep(i,mx+1) pf[i] = i;
  for (int i = 2; i <= mx; ++i) {
    if (pf[i] == i) ps.pb(i);
    for (int j = 0; j < sz(ps) && ps[j] <= pf[i]; ++j) {
      int x = ps[j]*i;
      if (x > mx) break;
      pf[x] = ps[j];
    }
  }
}
inline bool isp(int x) { return pf[x] == x && x >= 2;}
vp factor(int x) { // asc
  if (x == 1) return {};
  vp res(1, P(pf[x], 0));
  while (x != 1) {
    if (res.back().fi == pf[x]) res.back().se++;
    else res.pb(P(pf[x],1));
    x /= pf[x];
  }
  return res;
}
//

struct Solver {
  void solve() {
    int n;
    scanf("%d",&n);
    vi a(n+1,1);
    sieve(n);
    for (int p : ps) {
      ll x = p;
      while (x <= n) {
        for (int i = x; i <= n; i += x) a[i]++;
        x *= p;
      }
    }
    a.erase(a.begin());
    cout<<a<<endl;
  }
};

int main() {
  int ts = 1;
  // scanf("%d",&ts);
  rrep(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}
