//#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<cmath>
#include<map>
#include<functional>
#include<queue>
#include<set>
#include<stack>
#include<iomanip>
#include<algorithm>
#include<numeric>
#include<memory>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(a)   a.begin(),a.end()
template<typename T =ll> using v = vector<T>;
template<typename T =ll> using vv = v<v<T>>;
template<typename T =ll,typename U =ll> using p = pair<T,U>;
template<typename T> T chmin(T &a,T b) {return a=min(a,b);}
template<typename T> T chmax(T &a,T b) {return a=max(a,b);}
const ll INF = (ll)1e9;
template <int MOD>
struct ModInt {
    using lint = long long;
    int val;

    // constructor
    ModInt(lint v = 0) : val(v % MOD) {
        if (val < 0) val += MOD;
    };

    // unary operator
    ModInt operator+() const { return ModInt(val); }
    ModInt operator-() const { return ModInt(MOD - val); }
    ModInt inv() const { return this->pow(MOD - 2); }

    // arithmetic
    ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }
    ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }
    ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }
    ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }
    ModInt pow(lint n) const {
        auto x = ModInt(1);
        auto b = *this;
        while (n > 0) {
            if (n & 1) x *= b;
            n >>= 1;
            b *= b;
        }
        return x;
    }

    // compound assignment
    ModInt& operator+=(const ModInt& x) {
        if ((val += x.val) >= MOD) val -= MOD;
        return *this;
    }
    ModInt& operator-=(const ModInt& x) {
        if ((val -= x.val) < 0) val += MOD;
        return *this;
    }
    ModInt& operator*=(const ModInt& x) {
        val = lint(val) * x.val % MOD;
        return *this;
    }
    ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); }
    //
    ModInt operator++(int) {
        auto t = *this;
        *this += 1;
        return t;
    }

    ModInt operator--(int) {
        auto t = *this;
        *this -= 1;
        return t;
    }
    ModInt operator<<(const int n){
        return ModInt(*this)*ModInt(2).pow(n);
    }
    // compare
    bool operator==(const ModInt& b) const { return val == b.val; }
    bool operator!=(const ModInt& b) const { return val != b.val; }

    // I/O
    friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept { return is >> x.val; }
    friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }
};

constexpr int MOD = 1e9 + 7;
using mint = ModInt<MOD>;

void d(){
   ll N; cin >> N;
   N;
   auto A = v<>(N-1,0);
   auto B = v<>(N-1,0);
   auto G = vv<>(N);
   rep(i,N-1){
       cin >> A[i] >> B[i];
       A[i]--;
       B[i]--;

       G[A[i]].push_back(B[i]);
       G[B[i]].push_back(A[i]);
    }


    map<p<ll,ll>,ll> edge_color;
    rep(from,N){
        auto used_color = v<>();

        for(auto to:G[from]){
            if(!edge_color[p<>(from,to)]) continue;
            used_color.push_back(edge_color[p<>(from,to)]);
        }
        
        sort(all(used_color));

        ll color = 1;
        rep(i,G[from].size()){
            ll to = G[from][i];
            if(edge_color[p<>(from,to)]) {
                continue;
            }
            while(find(all(used_color),color)!=used_color.end()){
                color++;
            }
            
            edge_color[p<>(from,to)]=color;
            edge_color[p<>(to,from)]=color;
            color++;
        }


    }
    ll ans = 0;
    for(auto color:edge_color){
        chmax(ans,color.second);
    }
    cout << ans << endl;
    rep(i,N-1){
        cout << edge_color[p<>(A[i],B[i])]<<endl;
    }
    

}

int main(){
    d();
    return 0;
}

Measured memory_bytes: 20608