#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5;
int n, cnt1, cnt2;
bool odd[N]; //用odd数组记录每个结点深度的奇偶性
vector<int> e[N];
void dfs(int now, int fa, int dep)
{
    if (dep % 2)
    {
        cnt1++;
        odd[now] = 1;
    }
    else
        cnt2++;
    for (int i = 0; i < e[now].size(); i++)
    {
        int y = e[now][i];
        if (y == fa)
            continue;
        dfs(y, now, dep + 1);
    }
    return;
}
int main()
{
    ios::sync_with_stdio(0);
    cin >> n;
    for (int i = 1; i < n; i++)
    {
        int u, v;
        cin >> u >> v;
        e[u].push_back(v);
        e[v].push_back(u);
    }
    dfs(1, 0, 1);
    for (int i = 1; i <= n; i++)
    {
        if (odd[i])
            cout << cnt1 << " ";
        else
            cout << cnt2 << " ";
    }
    return 0;
}