#ifndef LOCAL
#include <bits/stdc++.h>

using namespace std;

#define debug(...) (void(0))
#else
#include "algo/debug.h"
#endif

namespace std {

template <class Fun>
class y_combinator_result {
    Fun fun_;

   public:
    template <class T>
    explicit y_combinator_result(T &&fun) : fun_(std::forward<T>(fun)) {}

    template <class... Args>
    decltype(auto) operator()(Args &&...args) {
        return fun_(std::ref(*this), std::forward<Args>(args)...);
    }
};

template <class Fun>
decltype(auto) y_combinator(Fun &&fun) {
    return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

}  // namespace std

void solve() {
    int N;
    cin >> N;
    vector<vector<int>> G(N);
    for (int i = 1; i < N; i++) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    queue<int> que;
    que.push(0);
    vector<int> dist(N, 1e9);
    dist[0] = 0;
    y_combinator([&](auto self, int v, int p = -1) -> void {
        bool is_leaf = true;
        for(const auto&to: G[v]) if(to != p) {
            is_leaf = false;
            self(to, v);
        }
        if(is_leaf) {
            que.push(v);
            dist[v] = 0;
        }
    })(0);
    while(!que.empty()) {
        int from = que.front(); que.pop();
        for(const auto&to: G[from]) {
            if(dist[to] > dist[from] + 1) {
                dist[to] = dist[from] + 1;
                que.push(to);
            }
        }
    }
    for(const int x: dist) cout << x << '\n';
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int tt = 1;
    // std::cin >> tt;
    while (tt--) {
        solve();
    }
}