#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}

int main(){
    int n;
    cin >> n;
    vector<vector<int>> to(n);
    rep(i,n-1){
        int u,v;
        cin >> u >> v;
        u--; v--;
        to[u].push_back(v);
        to[v].push_back(u);
    }
    vector<bool> seen(n,false);
    queue<int> que;
    int cnt = 0;
    seen[0] = true;
    que.push(0);
    while(que.size()){
        int now = que.front();
        que.pop();
        for(int x:to[now]){
            if(seen[x]) continue;
            seen[x] = true;
            if(now>x) cnt++;
            que.push(x);
        }
    }
    vector<int> ans(n);
    ans[0] = cnt;
    seen.assign(n,false);
    seen[0] = true;
    que.push(0);
    while(que.size()){
        int now = que.front();
        que.pop();
        for(int x:to[now]){
            if(seen[x]) continue;
            seen[x] = true;
            ans[x] = ans[now] + 1 - (now>x) * 2;
            que.push(x);
        }
    }
    for(int x:ans) cout << x << endl;
    return 0;
}