#include"evolution2.h"
#include<bits/stdc++.h>
using namespace std;
namespace{
    int n;
    int fa[10005];
    vector<int> edge[10005];
    int ans[10005];
    bool cmp(int x,int y){return compare(x-1,y-1);}
    vector<int> vec[10005];
    void merge(vector<int> &y,vector<int> &x){
        if(x.size()>y.size())swap(x,y);
        if(x.empty())return;
        int len=round(1.0*y.size()/x.size());
        int lst=-1,sx=x.size();
        for(int i:x){
            int k=0;
            while((sx<<k+1)<=y.size()-1-lst)k++;
            while(lst+(1<<k)<y.size()&&cmp(i,y[lst+(1<<k)]))lst+=1<<k;
            while(k--)if(lst+(1<<k)<y.size()&&cmp(i,y[lst+(1<<k)]))lst+=1<<k;
            lst++;
            y.insert(y.begin()+lst,i);
            sx--;
        }
        x.clear();
    }
    void dfs(int x){
        for(int y:edge[x]){
            dfs(y);
            merge(vec[x],vec[y]);
        }
        vec[x].push_back(x);
    }
}
vector<int> recover(int N,vector<int> U,vector<int> V){
    n=N;
    for(int i=1;i<=n;i++)edge[i].clear(),vec[i].clear();
    for(int i=0;i<N-1;i++)fa[V[i]+1]=U[i]+1,edge[U[i]+1].push_back(V[i]+1);
    dfs(1);
    for(int i=0;i<n;i++)ans[vec[1][i]]=n-i;
    vector<int> res;
    for(int i=1;i<=n;i++)res.push_back(ans[i]-1);
    return res;
}