#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>

using namespace std;

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define int long long
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template<typename T>T& max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T& min(T&a,T&b){if(a<b)return a;return b;}
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T get(){T a;cin>>a;return a;}
template<typename T>T rev(T a){reverse(all(a));return a;}
template<typename T>vector<T>&sort(vector<T>&a){sort(all(a));return a;}

const int inf = 1e9;
const ll linf = 3e18;
const double eps = 1e-9;

int par[100010];
vi ch[100010];
int d_leaf[100010];
bool used_d_leaf[100010];
int d_root[100010];

int get_d_leaf(int root)
{
    if (ch[root].size() == 1 && ch[root][0] == par[root]) return d_leaf[root] = 0;

    for (int u : ch[root]) {
        if (par[root] == u) continue;
        par[u] = root;
        chmin(d_leaf[root], get_d_leaf(u) + 1);
    }

    return d_leaf[root];
}

int get_d_root(int root)
{
    queue<int> q;
    q.push(root);
    d_root[root] = 0;

    while (q.size()) {
        int now = q.front(); q.pop();

        for (int u : ch[now]) {
            if (~d_root[u]) continue;
            d_root[u] = d_root[now] + 1;
            q.push(u);
        }
    }
}

signed main()
{
    int N; cin >> N;

    fill_n(par, N + 10, -1);
    fill_n(d_leaf, N + 10, inf);
    fill_n(d_root, N + 10, -1);

    for (int i = 0; i < N - 1; ++i) {
        int u, v; cin >> u >> v;
        --u, --v;
        ch[u].push_back(v);
        ch[v].push_back(u);
    }

    get_d_leaf(0);
    get_d_root(0);

    for (int i = 0; i < N; ++i) {
        cout << min(d_leaf[i], d_root[i]) << endl;
    }
}