#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<bool> vb;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;

ll INF = 1e16;
int inf = 1e9;

#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (ll i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (ll i = ((n) - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll

// inputs
#define VLLIN(x, n) vll x(n); REP(i, n) cin >> x[i];
#define VIIN(x, n) vi x(n); REP(i, n) cin >> x[i];
#define VLDIN(x, n) vld x(n); REP(i, n) cin >> x[i];
#define SIN(s, n) string s; cin >> s;

#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...)  cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif

void d_err() {
    cerr << endl;
}

template <typename H, typename... T>
void d_err(H h, T... t) {
    cerr << h << " ";
    d_err(t...);
}

template <typename T>
void print(T x) {
    cout << x << "\n";
}

template <typename T>
void print(vector<T>& x) {
    int N = x.size();
    REP(i, N) {
        if (i > 0) cout << " ";
        cout << x[i];
    }
    cout << "\n";
}

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    int n; cin >> n;
    vector<int> a(n-1), b(n-1);
    REP(i, n-1) cin >> a[i] >> b[i];
    REP(i, n-1) a[i]--, b[i]--;

    vector<vector<int>> edge(n);
    REP(i, n-1) {
        edge[a[i]].eb(b[i]);
        edge[b[i]].eb(a[i]);
    }

    vector<int> c1(n);

    auto dfs1 = [&](int cur, int prev, auto&& f) -> int {
        for (auto &e: edge[cur]) {
            if (e == prev) continue;
            if (cur > e) c1[cur]++;
            c1[cur] += f(e, cur, f);
        }

        return c1[cur];
    };

    dfs1(0, -1, dfs1);

    vector<int> ans(n);

    auto dfs2 = [&](int cur, int prev, int c, auto&& f) -> void {
        ans[cur] = c;
        for (auto &e: edge[cur]) {
            if (e == prev) continue;
            f(e, cur, (cur > e) ? c : c+1, f);
        }
    };

    dfs2(0, -1, c1[0], dfs2);

    REP(i, n) print(ans[i]);
}