#include <iostream>
#include <vector>
#include <set>
using namespace std;
set<int> c[200010];
vector<int> g[200010], p(200010, 0), a(200010, 0);
void dfs(int cur, int pre) {
if(pre != -1) {
while(c[pre].count(p[pre])) p[pre]++;
a[cur] = p[pre];
c[pre].insert(a[cur]);
c[cur].insert(a[pre]);
}
c[cur].insert(a[cur]);
for(int i=0;i<g[cur].size();i++) {
if(g[cur][i] != pre) {
dfs(g[cur][i], cur);
}
}
}
int main() {
int n;
cin >> n;
for(int i=0;i<n-1;i++) {
int a, b;
cin >> a >> b;
a--; b--;
g[a].push_back(b);
g[b].push_back(a);
}
dfs(0, -1);
int ans = 0;
for(int i=0;i<n;i++) {
ans = max(ans, a[i]);
}
cout << ans + 1 << endl;
for(int i=0;i<n;i++) {
cout << a[i] + 1 << " ";
}
cout << endl;
}