#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define elif else if
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int,int>


#define repname(a, b, c, d, e, ...) e
#define rep(...)                    repname(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define rep0(x)                     for (int rep_counter = 0; rep_counter < (x); ++rep_counter)
#define rep1(i, x)                  for (int i = 0; i < (x); ++i)
#define rep2(i, l, r)               for (int i = (l); i < (r); ++i)
#define rep3(i, l, r, c)            for (int i = (l); i < (r); i += (c))





struct ScalarInput {
    template<class T>
    operator T(){
        T ret;
        cin >> ret;
        return ret;
    }
};
struct VectorInput {
    size_t n;
    VectorInput(size_t n): n(n) {}
    template<class T>
    operator vector<T>(){
        vector<T> ret(n);
        for(T &x : ret) cin >> x;
        return ret;
    }
};
ScalarInput input(){ return ScalarInput(); }
VectorInput input(size_t n){ return VectorInput(n); }

template<typename T>
void print(vector<T> a){
  for(int i=0;i<a.size();i++){
    cout<<a[i]<<" \n"[i+1==a.size()];
  }
}

template<class T>
void print(T x){
    cout << x << '\n';
}
 
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail){
  cout << head << ' ';
  print(forward<Tail>(tail)...);
}


int N=200010;
vector<vector<int>>C(N);
vector<vector<int>>edge(N);
void dfs(int v,int par){
  for(auto u:edge[v]){
    dfs(u,v);
  }
  if(edge[v].size()==0){
    C[v].push_back(1);
    return;
  }
  if(edge[v].size()==1){
    C[v]=C[edge[v][0]];
    return;
  }
  pii mx1={-1,-1};
  pii mx2={-1,-1};
  for(auto u:edge[v]){
    if(C[u].back()>mx1.first){
      swap(mx1,mx2);
      mx1={C[u].back(),u};
    }
    elif(C[u].back()>mx2.first){
      mx2={C[u].back(),u};
    }
  }
  int mx=mx1.first+mx2.first;
  C[mx1.second].pop_back();
  C[mx2.second].pop_back();
  for(auto u:edge[v]){
    if(C[v].size()<C[u].size()){
      swap(C[u],C[v]);
    }
    for(auto s:C[u]){
      C[v].push_back(s);
    }
  }
  C[v].push_back(mx);
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n;
  cin>>n;
  rep(i,n-1){
    int p;
    cin>>p;
    edge[p-1].push_back(i+1);
  }
  dfs(0,-1);
  sort(C[0].begin(),C[0].end());
  reverse(C[0].begin(),C[0].end());
  vector<int>ans;
  int tmp=0;
  for(auto x:C[0]){
    rep(i,x){
      if(i==0){
        tmp+=1;
      }
      else{
        tmp+=2;
      }
      ans.push_back(tmp);
    }
  }
  print(ans);
}