#include<iostream>

#include<cstdio>

#include<cmath>

#include<cstdlib>

#include<cstring>

#include<algorithm>

using namespace std;

int read()

{

    int x=,f=;char c=getchar();

    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}

    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();

    return x*f;

}

#define N 1000010

int n,p[N],root[N],deep[N],ans[N],t=,cnt=;

struct data{int to,nxt;

}edge[N<<];

struct data2{int l,r,x,s;

}tree[N*];

void addedge(int x,int y){t++;edge[t].to=y,edge[t].nxt=p[x],p[x]=t;}

void up(int k)

{

    if (tree[tree[k].l].s>=tree[tree[k].r].s)

    tree[k].s=tree[tree[k].l].s,tree[k].x=tree[tree[k].l].x;

    else tree[k].s=tree[tree[k].r].s,tree[k].x=tree[tree[k].r].x;

}

int merge(int x,int y,int l,int r)

{

    if (!x||!y) return x|y;

    if (l==r) tree[x].s+=tree[y].s;

    else

    {

        int mid=l+r>>;

        tree[x].l=merge(tree[x].l,tree[y].l,l,mid);

        tree[x].r=merge(tree[x].r,tree[y].r,mid+,r);

        up(x);

    }

    return x;

}

void ins(int &k,int x,int l,int r)

{

    if (!k) k=++cnt;

    if (l==r) {tree[k].s++,tree[k].x=x;return;}

    int mid=l+r>>;

    if (x<=mid) ins(tree[k].l,x,l,mid);

    else ins(tree[k].r,x,mid+,r);

    up(k);

}

void dfs(int k,int from)

{

    for (int i=p[k];i;i=edge[i].nxt)

    if (edge[i].to!=from)

    {

        deep[edge[i].to]=deep[k]+;

        dfs(edge[i].to,k);

        root[k]=merge(root[k],root[edge[i].to],,n);

    }

    ins(root[k],deep[k],,n);

    ans[k]=tree[root[k]].x-deep[k];

}

int main()

{

#ifndef ONLINE_JUDGE

    freopen("dsu.in","r",stdin);

    freopen("dsu.out","w",stdout);

    const char LL[]="%I64d\n";

#else

    const char LL[]="%lld\n";

#endif

    n=read();

    for (int i=;i<n;i++)

    {

        int x=read(),y=read();

        addedge(x,y),addedge(y,x);

    }

    deep[]=;dfs(,);

    for (int i=;i<=n;i++) printf("%d\n",ans[i]);

    return ;

}