#include <cstdio>
#include <vector>
#include <set>
#include <map>

#define X first
#define Y second
#define PB push_back

using namespace std;

const int N = 2e5 + 500;

map < int, int > mp[N];

int n;
vector < int > v[N];

void dfs(int x){
	if((int)v[x].size() == 0) {
		mp[x][0] = 1; return;
	}
	if((int)v[x].size() == 1) {
		dfs(v[x][0]); swap(mp[x], mp[v[x][0]]);
		return;
	}
	for(int y : v[x]) {
		dfs(y);
		if((int)mp[y].size() > (int)mp[x].size())
			swap(mp[x], mp[y]);
		for(auto tmp : mp[y]) mp[x][tmp.X] += tmp.Y;
	}
	mp[x][0] -= (int)v[x].size() - 2;
	mp[x][1] += (int)v[x].size() - 2;
}

int main(){
	scanf("%d", &n);
	for(int i = 2;i <= n;i++) {
		int p; scanf("%d", &p);
		v[p].PB(i);
	}
	dfs(1);
	vector < int > ans;
	for(auto tmp : mp[1]) {
		int t = tmp.Y;
		for(;t--;) ans.PB(tmp.X);
	}
	int sol = 0;
	for(int i = 0;i < (int)ans.size();i++) {
		sol += ans[i];
		printf("%d ", 2 * i + 1 - sol);
	}
	printf("\n");
	return 0;
}