#include <bits/stdc++.h>
#define int long long
#define double long double
#define pii pair <int,int>
#define tiii tuple <int, int, int>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define ub(a, b) upper_bound(a.begin(), a.end(), b) - a.begin()
#define lb(a, b) lower_bound(a.begin(), a.end(), b) - a.begin()
#define ve vector
#define graph(a, n) vector <int> a[n];
#define wgraph(a, n) vector <pii> a[n];
#define emb emplace_back
#define em emplace
#define ins insert
#define er erase
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)
using namespace std;
template <typename T>
using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;
const int mod = 1e9 + 7;
const int inf = 1e18;
const int N = 2e5 + 5;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int n, child[N], ans[N];
vector <int> adj[N];
void dfs(int u){
child[u] = ans[u] = 1;
for (auto v : adj[u]) {
dfs(v);
child[u] += child[v];
ans[u] += ans[v] + child[v];
}
}
int32_t main(){
iShowSpeed;
cin >> n;
for (int i = 2; i <= n; i++) {
int x; cin >> x;
adj[x].emb(i);
}
dfs(1);
for (int i = 1; i <= n; i++) cout << ans[i] << " ";
}
