#include <bits/stdc++.h>
using namespace std;
#define int long long
int mxn = 200005;
vector<vector<int>>adj(mxn); int ln = 20;
vector<vector<int>>dp(mxn,vector<int>(ln));
vector<int>lvl(mxn);
vector<int>loc(mxn);
int timer = 0;
void dfs(int u, int p){
    timer++;
    loc[u] = timer;
    lvl[u] = lvl[p]+1;
    dp[u][0] = p;
    for(int i = 1; i<ln; i++){
        dp[u][i] = dp[dp[u][i-1]][i-1];
    }
    for(int nxt: adj[u]){
        if(nxt==p)continue;
        dfs(nxt,u);
    }
}
int lca(int x, int y){
    if(lvl[x]<lvl[y])swap(x,y);
    int dif = lvl[x]-lvl[y];
    for(int i = 0; i<ln; i++){
        if((1<<i)&dif){
            x = dp[x][i];
        }
    }
    if(x==y)return x;
    for(int i = ln-1; i>=0; i--){
        if(dp[x][i]!=dp[y][i]){
            x = dp[x][i]; y = dp[y][i];
        }
    }
    return dp[x][0];
}
int dist(int x, int y){
    int u = lca(x,y);
    return lvl[x]+lvl[y]-2*lvl[u];
}
bool comp(int x, int y){
    return loc[x] < loc[y];
}
signed main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    for(int i = 2; i<=n; i++){
        int x;
        cin >> x;
        adj[i].push_back(x);
        adj[x].push_back(i);
    }
    dfs(1,0);
    vector<int>vec;
    for(int i = 2; i<=n; i++){
        if(adj[i].size()==1){
            vec.push_back(i);
        }
    }
    sort(vec.begin(),vec.end(),comp);
    set<int>s;
    for(int i = 1; i<vec.size(); i++){
        s.insert(lca(vec[i-1],vec[i]));
    }
    int ans = 0;
    for(int i = 0; i<vec.size(); i++){
        ans++;
        cout << ans;
        if(i+1 < vec.size())cout << ' ';
        if(i<s.size())ans++;
    }
    cout << '\n';
    return 0;
}