#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>

#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
const int inf = (int)1e+9;

using namespace std;


int inputValue(){
    int a;
    cin >> a;
    return a;
};

void inputArray(int * p, int a){
    rep(i, a){
        cin >> p[i];
    }
};

void inputVector(vector<int> * p, int a){
    rep(i, a){
        int input;
        cin >> input;
        p -> push_back(input);
    }
}

template <typename T>
void output(T a, int precision) {
    if(precision > 0){
        cout << setprecision(precision)  << a << "\n";
    }
    else{
        cout << a << "\n";
    }
}

vector<int> node[100000];
int cost[100000];

int main(int argc, const char * argv[]) {
    
    // source code
    int N = inputValue();
    
    rep(i, N){
        cost[i] = inf;
    }
    
    rep(i, N - 1){
        int x, y;
        std::cin >> x >> y;
        node[x - 1].push_back(y - 1);
        node[y - 1].push_back(x - 1);
    }
    
    queue<int> q;
    cost[0] = 0;
    q.push(0);
    rep(i, N){
        if (node[i].size() == 1) {
            cost[i] = 0;
            q.push(i);
        }
    }
    
    while (!q.empty()) {
        int f = q.front();
        q.pop();
        rep(i, node[f].size()){
            if (cost[node[f][i]] > cost[f] + 1) {
                cost[node[f][i]] = cost[f] + 1;
                q.push(node[f][i]);
            }
        }
    }
    
    rep(i, N){
        output(cost[i], 0);
    }
    
    return 0;
}