c4tree

//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 10005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;
const int maxc = 4;

int n;
vector<int> g[N];
int dp[N][5];
int par[N], r[N];

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin >> n;
    for(int i=1; i<n; i++){
        int u, v;
        cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }
}

void dfs(int u, int pre){
    for(int i=1; i<=4; i++) dp[u][i] = i;
    for(auto v : g[u]){
        if (v!=pre){
            par[v] = u;
            dfs(v,u);
            for(int i=1; i<=4; i++){
                int t = -1;
                for(int j=1; j<=4; j++){
                    if (j!=i && (t<0||dp[v][t]>dp[v][j])) t=j;
                }
                dp[u][i]+=dp[v][t];
            }
        }
    }
}

void trace(int u, int pre, int c){
    r[u]=c;
    for(auto v: g[u]){
        if (v!=pre){
            int t = -1;
            for(int i=1; i<=4; i++) if (i!=c && ( t<0 || dp[v][t]>dp[v][i])) t=i;
            trace(v,u,t);
        }
    }
}

void proc()
{
    dfs(1,1);
    int j=1;
    for(int i=1; i<=maxc; i++) if (dp[1][j]>dp[1][i]) j=i;
    trace(1,1,j);
    cout << dp[1][j] << '\n';
    for(int i=1; i<=n; i++) cout << r[i] << '\n';
}

signed main()
{
    readfile();
    proc();
    return 0;
}