#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
using i64 = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

const int inf = 987654321;
vector<vector<int>> G;

int main(void) {
  int n; scanf("%d", &n);
  G.assign(n, vector<int>());
  for(int i : range(n-1)) {
    int x, y; scanf("%d%d", &x, &y);
    x--, y--;
    G[x].push_back(y);
    G[y].push_back(x);
  }
  vector<int> dist(n, inf);
  dist[0] = 0;
  queue<int> que;
  que.push(0);
  for(int v : range(1, n)) {
    if(G[v].size() == 1) {
      dist[v] = 0;
      que.push(v);
    }
  }
  while(!que.empty()) {
    int v = que.front(); que.pop();
    for(int vv : G[v]) {
      if(dist[vv] > dist[v] + 1) {
        dist[vv] = dist[v] + 1;
        que.push(vv);
      }
    }
  }
  for(int v : range(n)) {
    printf("%d\n", dist[v]);
  }
  return 0;
}