#include <bits/stdc++.h>


#pragma GCC optimize("Ofast,fast-math,unroll-loops")
#pragma GCC target("avx2,fma")
using namespace std;
#define ll long long
#define int ll
#define all(a) a.begin(),a.end()
#define allr(a) a.rbegin(),a.rend()
#define pb push_back
#define yes cout<<"YES"
#define no cout<<"NO"
#define endl '\n'
#define endll cout<<endl
#define Fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define F first
#define S second
#define im cout<<"IMPOSSIBLE"
const int N = 3e5 + 11;
const int NN = 106;
const int mo = 1e9 + 123;
const int mod = 1e9 + 7;
const int Mod = 998244353;
const ll inf = 1e18;
const int LOG = 19;
#define PI 3.14159265


int Lcm(int x, int y) {
    return x / __gcd(x, y) * y;
}

vector<int> v[N];
vector<pair<int, int>> pr;
vector<pair<int, int>> pr1;
int dist[N];
int dist1[N];

void dfs(int node, int f = 0, int par = -1, int cnt = 0) {
    if (f) {
        dist1[node] = cnt;
        pr1.pb({cnt, node});
    } else {
        dist[node] = cnt;
        pr.pb({cnt, node});
    }
    for (auto i: v[node]) {
        if (i == par)
            continue;
        dfs(i, f, node, cnt + 1);
    }
}

void solve() {
    int n;
    cin >> n;
    for (int i = 0; i < n - 1; ++i) {
        int x, y;
        cin >> x >> y;
        v[x].pb(y);
        v[y].pb(x);
    }
    dfs(1);
    sort(allr(pr));
    dfs(pr[0].S, 1);
    sort(allr(pr1));
    set<int> st;
    for (auto i: pr) {
        if (i.F == pr[0].F)
            st.insert(i.S);
    }
    for (auto i: pr1) {
        if (i.F == pr1[0].F)
            st.insert(i.S);
    }
    int mx = pr1[0].F;
    for (int i = 1; i <= n; ++i) {
        if (st.find(i) != st.end())
            cout << mx + 1;
        else cout << mx;
        endll;
    }

}

int32_t main() {
    Fast;
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    int t = 1;
    //cin >> t;

    for (int i = 1; i < t + 1; ++i) {
        // cout << "Case #" << i << ": ";
        solve();
    }
    return 0;
}