#include<iostream>
#include<bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
/*---------------------DEBUGGING--------------------------------------------*/
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
/*-------------------------------------------------------------------------------------*/
//#define mp make_pair
#define pb push_back
#define ll long long
#define pii pair<int,int>
#define pcc pair<char,char>
#define F first
#define S second
#define int long long
#define pi 3.141592653589793238462643383279502
#define M  1000000007
#define rep(i,a,n) for(int i=a;i<n;i++)
#define INF 10000000000000
#define N 200005
#define vi vector<int>
#define all(v) v.begin(),v.end()
//#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
vector<int>adj[N];
map<pii,int>col;int mx=0;
void bfs(int u,int par)
{
    queue<pii>q;
    q.push({u,par});
    while(!q.empty())
    {
        pii p=q.front();
        //debug(p);
        q.pop();
        if(p.S)
        {
            int c=1;
            int val=col[{p.F,p.S}];
            for(auto x:adj[p.F])
            {
                if(x!=p.S)
                {
                    if(c == val)c++;
                    col[{x,p.F}]=c;
                    col[{p.F,x}]=c;
                    c++;
                    q.push({x,p.F});
                }
            }
        }
        else
        {
            int c=1;
            for(auto x:adj[p.F])
            {
                col[{x,p.F}]=c;
                col[{p.F,x}]=c;
                c++;
                q.push({x,p.F});
            }
        }
    }
}
signed main()
{
   ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
   int n;
   cin>>n;
   vector<pii>edges;
   rep(i,0,n-1)
   {
       int u,v;
       cin>>u>>v;
       adj[u].pb(v);
       adj[v].pb(u);
       edges.pb({u,v});
   }
   //debug(adj[6]);
   int source;
   for(int i=1;i<=n;i++)
   {
       if(adj[i].size()>mx)
       {
           mx=adj[i].size();
           source=i;
       }
   }
   //debug(source);
   bfs(source,0);
   cout<<mx<<endl;
   for(int i=0;i<edges.size();i++)
   {   int x=edges[i].F;
       int y=edges[i].S;
       cout<<col[{x,y}]<<endl;
   }

}



Measured memory_bytes: 23024