Codeforces 780C-Andryusha and Colored Balloons

Andryusha and Colored Balloons

time limit per test
2 seconds

memory limit per test
256 megabytes

input
standard input

output
standard output

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.

Examples

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.

题意：有n个点，n-1条边将它们连成一棵树，给这n个点涂色，保证一个点和其相邻点颜色不能相同，问最少需要多少种颜色，并给出涂色方案

解题思路：dfs

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>

using namespace std;

#define LL long long
const int INF=0x3f3f3f3f;

int s[2000009],e[2000009],nt[2000009];
int n,a[2000009],sum;

void dfs(int x,int p)
{
int cnt=1;
for(int i=s[x];~i;i=nt[i])
{
int ee=e[i];
if(ee==p) continue;
while(cnt==a[x]||cnt==a[p]) cnt++;
a[ee]=cnt++;
}
sum=max(cnt,sum);
for(int i=s[x];~i;i=nt[i])
{
int ee=e[i];
if(p==ee) continue;
dfs(ee,x);
}
}

int main()
{
while(~scanf("%d",&n))
{
int cnt=1,f,t;
sum=2;
memset(s,-1,sizeof s);
memset(nt,-1,sizeof nt);
memset(a,0,sizeof a);
for(int i=1;i<n;i++)
{
scanf("%d %d",&f,&t);
nt[cnt]=s[f],e[cnt]=t,s[f]=cnt++;
nt[cnt]=s[t],e[cnt]=f,s[t]=cnt++;
}
a[1]=1;
dfs(1,0);
printf("%d\n%d",sum-1,a[1]);
for(int i=2;i<=n;i++) printf(" %d",a[i]);
printf("\n");
}
return 0;
}