1 #include<bits/stdc++.h>
 2 #define F(i,a,b) for(int i=a;i<=b;++i)
 3 using namespace std;
 4 
 5 const int N=2e5+7;
 6 int n,g[N],v[N*2],nxt[N*2],ed,cnt,ans[N];
 7 void adg(int x,int y){v[++ed]=y,nxt[ed]=g[x],g[x]=ed;}
 8 
 9 void dfs(int x,int fa)
10 {
11     int cnt=1;
12     for(int i=g[x];i;i=nxt[i])if(v[i]!=fa)
13     {
14         while(cnt==ans[fa]||cnt==ans[x])cnt++;
15         ans[v[i]]=cnt,cnt++;
16     }
17     for(int i=g[x];i;i=nxt[i])if(v[i]!=fa)
18     {
19         dfs(v[i],x);
20     }
21 }
22 
23 int main(){
24     scanf("%d",&n);
25     int x,y;
26     F(i,1,n-1)
27     {
28         scanf("%d%d",&x,&y);
29         adg(x,y),adg(y,x);
30     }
31     ans[1]=1;
32     dfs(1,0);
33     int an=0;
34     F(i,1,n)an=max(an,ans[i]);
35     printf("%d\n",an);
36     F(i,1,n)printf("%d%c",ans[i]," \n"[i==n]);
37     return 0;
38 }