[codeforces] #403 div1 A (div2 C)

#include <bits/stdc++.h>
using namespace std;

const int n_ = 2e5 + 10;

int n, ans, col[n_];
vector<int> gph[n_];

void dfs(int prv, int cur) {
	int i = 1;
	for (auto nxt : gph[cur]) {
		if (col[nxt]) continue;
		while (col[prv] == i || col[cur] == i) i++;
		col[nxt] = i++;
		ans = max(ans, i);
		dfs(cur, nxt);
	}
}

int main() {
	int i, j;
	scanf("%d", &n);
	for (i = 0; i < n - 1; i++) {
		int a, b;
		scanf("%d %d", &a, &b);
		gph[a].push_back(b);
		gph[b].push_back(a);
	}

	col[1] = 1;
	dfs(0, 1);

	printf("%d\n", ans - 1);
	for (i = 1; i <= n; i++) printf("%d ", col[i]);

	return 0;
}