#include<bits/stdc++.h>

#define reg register int

#define il inline

#define fi first

#define se second

#define mk(a,b) make_pair(a,b)

#define numb (ch^'0')

#define pb push_back

#define solid const auto &

#define enter cout<<endl

#define pii pair<int,int>

using namespace std;

typedef long long ll;

template<class T>il void rd(T &x){

    char ch;x=;bool fl=false;while(!isdigit(ch=getchar()))(ch=='-')&&(fl=true);

    for(x=numb;isdigit(ch=getchar());x=x*+numb);(fl==true)&&(x=-x);}

template<class T>il void output(T x){if(x/)output(x/);putchar(x%+'');}

template<class T>il void ot(T x){if(x<) putchar('-'),x=-x;output(x);putchar(' ');}

template<class T>il void prt(T a[],int st,int nd){for(reg i=st;i<=nd;++i) ot(a[i]);putchar('\n');}

namespace Modulo{

const int mod=;

int ad(int x,int y){return (x+y)>=mod?x+y-mod:x+y;}

void inc(int &x,int y){x=ad(x,y);}

int mul(int x,int y){return (ll)x*y%mod;}

void inc2(int &x,int y){x=mul(x,y);}

int qm(int x,int y=mod-){int ret=;while(y){if(y&) ret=mul(x,ret);x=mul(x,x);y>>=;}return ret;}

}

//using namespace Modulo;

namespace Miracle{

const int N=5e5+;

int n;

int fa[N][];

ll g[N];

struct node{

    int nxt,to;

}e[N];

int hd[N],cnt;

void add(int x,int y){

    e[++cnt].nxt=hd[x];

    e[cnt].to=y;

    hd[x]=cnt;

}

int dfn[N],df;

int dep[N];

vector<int>mem[N];

int mx;

void dfs(int x,int d){

    dep[x]=d;

    mx=max(mx,d);

    mem[d].pb(x);

    for(reg i=hd[x];i;i=e[i].nxt){

        int y=e[i].to;

        dfs(y,d+);

    }

}

struct po{

    int id,pos,d;

    po(){}

    po(int ii,int dd,int pp){

        id=ii;pos=pp;d=dd;

    }

}sta[N];

int top;

ll calc(){

    if(!top) return ;

    return (ll)(sta[top].pos-sta[top-].pos)*sta[top].d;

}

int lca(int x,int y){

    if(dep[x]<dep[y]) swap(x,y);

    for(reg j=;j>=;--j){

        if(dep[fa[x][j]]>=dep[y]) x=fa[x][j];

    }

    if(x==y) return x;

    for(reg j=;j>=;--j){

        if(fa[x][j]!=fa[y][j]) x=fa[x][j],y=fa[y][j];

    }

    return fa[x][];

}

void sol(vector<int>&v){

    int o=;

    top=;

    ll val=;

    for(solid x:v){

        if(!o){

            ++top;sta[top]=po(x,,);

        }

        else{

            while(){

                int y=lca(sta[top].id,x);

                if(dep[y]>=sta[top].d){

                    ++top;sta[top]=po(x,dep[y],o);break;

                }

                val-=calc();

                --top;

            }

            val+=calc();

            g[x]+=val;

        }

        ++o;

    }

}

int main(){

    rd(n);

    int rt=;

    for(reg i=;i<=n;++i){

        rd(fa[i][]);if(fa[i][]==) rt=i;

        else add(fa[i][],i);

    }

    dfs(rt,);

    for(reg j=;j<=;++j){

        for(reg i=;i<=n;++i){

            fa[i][j]=fa[fa[i][j-]][j-];

        }

    }

    for(reg i=;i<=mx;++i){

        for(solid x:mem[i]) g[x]=g[fa[x][]]+i-;

        sol(mem[i]);

        reverse(mem[i].begin(),mem[i].end());

        sol(mem[i]);

    }

    prt(g,,n);

    return ;

}

}

signed main(){

    Miracle::main();

    return ;

}

/*

   Author: *Miracle*

*/