describe

Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.

The park consists of n squares connected with (n - 1) bidirectional paths in such a way that any square is reachable from any other using these paths. Andryusha decided to hang a colored balloon at each of the squares. The baloons' colors are described by positive integers, starting from 1. In order to make the park varicolored, Andryusha wants to choose the colors in a special way. More precisely, he wants to use such colors that if a, b and c are distinct squares that a and b have a direct path between them, and b and c have a direct path between them, then balloon colors on these three squares are distinct.

Andryusha wants to use as little different colors as possible. Help him to choose the colors!

Input

The first line contains single integer n (3 ≤ n ≤ 2·105) — the number of squares in the park.

Each of the next (n - 1) lines contains two integers x and y (1 ≤ x, y ≤ n) — the indices of two squares directly connected by a path.

It is guaranteed that any square is reachable from any other using the paths.

Output

In the first line print single integer k — the minimum number of colors Andryusha has to use.

In the second line print n integers, the i-th of them should be equal to the balloon color on the i-th square. Each of these numbers should be within range from 1 to k.

input

3
2 3
1 3

output

3
1 3 2 

input

5
2 3
5 3
4 3
1 3

output

5
1 3 2 5 4 

input

5
2 1
3 2
4 3
5 4

output

3
1 2 3 1 2 

Note

In the first sample the park consists of three squares: 1 → 3 → 2. Thus, the balloon colors have to be distinct.

Illustration for the first sample.

In the second example there are following triples of consequently connected squares:

• 1 → 3 → 2
• 1 → 3 → 4
• 1 → 3 → 5
• 2 → 3 → 4
• 2 → 3 → 5
• 4 → 3 → 5

We can see that each pair of squares is encountered in some triple, so all colors have to be distinct.

Illustration for the second sample.

In the third example there are following triples:

• 1 → 2 → 3
• 2 → 3 → 4
• 3 → 4 → 5

We can see that one or two colors is not enough, but there is an answer that uses three colors only.

Illustration for the third sample.

thinking

A tree has n nodes. You need to color all its nodes. Three adjacent nodes cannot have the same color. Ask how many colors are needed at least.
Three adjacent nodes mean that nodes X1 and x2 are adjacent, x2 and x3 are adjacent, so X1 and x3 are also adjacent, and x1, x2 and x3 have different colors

It is easy to deduce that the number of colors is the maximum degree of all points + 1

Using bfs, start coloring from 1 every time, mark your father and grandfather, and change the color if it is your father or grandfather until it is not

Code

#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
vector<int> e[N];
int vis[N], color[N], in[N], tot = 0;
int fmax(int a, int b, int c)
{
    return max(max(a, b), c);
}
void bfs(int u, int fa)
{

    int num = 1;
    for (auto v : e[u])
    {
        if (v == fa)
            continue;
        while (num == color[u] || num == color[fa])
            num++;
        color[v] = num++;
    }
    for (auto v : e[u])
    {
        if (v == fa)
            continue;
        bfs(v, u);
    }
}
int main()
{
    int n, u, v;
    scanf("%d", &n);
    for (int i = 1; i <= n - 1; i++)
    {
        scanf("%d%d", &u, &v);
        in[u]++, in[v]++;
        tot = fmax(tot, in[u], in[v]);
        e[u].push_back(v);
        e[v].push_back(u);
    }
    color[1] = 1;
    bfs(1, 0);
    tot++;
    printf("%d\n", tot);
    for (int i = 1; i <= n; i++)
        printf("%d ", color[i]);
    puts("");
    return 0;
}