// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T& x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T& x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 2e5 + 10;
int n, f[N], s;
vector <int> v[N];
void dfs(int x) {
	if (v[x].empty()) {
		f[x] = 1;
		s++;
		return;
	}
	int mx1 = 0, mx2 = 0;
	for (int i: v[x]) {
		dfs(i);
		if (f[i] > mx1) mx2 = mx1, mx1 = f[i];
		else chkmax(mx2, f[i]);
	}
	f[x] = mx1 + mx2;
}
signed main() {
	read(n);
	F(i, 2, n) {
		int x;
		read(x);
		v[x].push_back(i);
	}
	dfs(1);
	// debug << f[1] << endl;
	F(i, 1, s) {
		if (i <= f[1]) cout << 2 * i - 1 << ' ';
		else cout << 2 * f[1] - 1 + i - f[1] << ' ';
	}
	return 0;
}
/* why?
*/