#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int N,M,Q;

#if DEBUG
vector<set<int>> E(6);
vector<int> L(6, INT_MAX);
int D[6];
#else
vector<set<int>> E(123450);
vector<int> L(123450, INT_MAX);
int D[111111];
#endif

void dfs(int parent=-1, int i=0, int depth=0) {
    D[i] = depth;
    for (auto e : E[i]) {
        if (e == parent) continue;
        dfs(i, e, depth+1);
    }
}

void bfs() {
    queue<int> que;
    FOR(i,1,N) if (E[i].size()==1) {
        L[i]=0;
        que.push(i);
    }
    while(que.size()) {
        int i = que.front();
        que.pop();
        for (auto e : E[i]) {
            int cost = L[i] + 1;
            if (L[e] > cost) {
                L[e] = cost;
                que.push(e);
            }
        }
    }
}

void setup_tree() {
    dfs();
    bfs();
}
/**********************************************************/


void solve() {
    cin>>N;
    int u,v;
    REP(_,N-1) {
        cin>>u>>v;
        u--;
        v--;
        E[u].insert(v);
        E[v].insert(u);
    }
    setup_tree();
    REP(i,N) {
        out("%lld\n", min(D[i], L[i]));
    }
}