#include using namespace std; int R[100005]; int L[100005]; vector adj[100005]; int n, x, y; void dfs(int now,int prev) { for (auto next : adj[now]) { if (prev == next) continue; R[next] = R[now] + 1; dfs(next, now); } } int solve(int now, int prev) { if (L[now] != -1) { return L[now]; } int res = 1e9; for (auto next : adj[now]) { if (prev == next) { continue; } res = min(res, solve(next, now) + 1); } if (res >= 1e9) { res = 0; } L[now] = res; return L[now]; } void dfs2(int now, int prev, int U) { multiset S; L[now] = min(L[now], U); for (auto next : adj[now]) { if (next == prev) continue; S.insert(L[next] + 1); } for (auto next : adj[now]) { if (prev == next) continue; S.erase(L[next] + 1); if (!S.empty()) { int MIN = *S.begin(); MIN = min(MIN + 1, U); dfs2(next, now, MIN); } else { dfs2(next, now, U); } S.insert(L[next] + 1); } } int main(void) { cin.tie(0); ios::sync_with_stdio(false); cin >> n; for (int i = 0; i < n - 1; i++) { cin >> x >> y; adj[x].push_back(y); adj[y].push_back(x); } memset(L, -1, sizeof(L)); R[1] = 0; dfs(1, 0); solve(1, 0); dfs2(1, 0, 1e9); for (int i = 1; i <= n; i++) { cout << min(L[i], R[i]) << '\n'; } return 0; }