#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <tuple>
using namespace std;

int main() {
    int n; cin >> n;
    vector<vector<int>> g(n);
    for (int i = 0; i < n - 1; i++) {
        int x, y; cin >> x >> y; x--, y--;
        g[x].emplace_back(y);
        g[y].emplace_back(x);
    }
    vector<int> start{0};
    for (int i = 0; i < n; i++) {
        if (g[i].size() == 1) start.emplace_back(i);
    }
    vector<int> dist(n, -1);
    queue<pair<int, int>> que;
    for (int u: start) que.emplace(u, -1), dist[u] = 0;
    while (!que.empty()) {
        int u, p;
        tie(u, p) = que.front(); que.pop();
        for (int v: g[u]) if (v != p) {
            if (~dist[v]) continue;
            dist[v] = dist[u] + 1;
            que.emplace(v, u);
        }
    }
    for (int d: dist) cout << d << endl;
    return 0;
}