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

#define rep(i, n) for(int i=0; i < (n); ++i)
#define ll long long

template<class T> using v = std::vector<T>;
template<class T> using vv = v<v<T>>;

const int mod = 1000000007;
//const int mod = 998244353;

struct mint {
    ll x; // typedef long long ll;
    mint(ll x=0):x((x%mod+mod)%mod){}
    mint operator-() const { return mint(-x);}
    mint& operator+=(const mint a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator-=(const mint a) {
        if ((x += mod-a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
    mint operator+(const mint a) const { return mint(*this) += a;}
    mint operator-(const mint a) const { return mint(*this) -= a;}
    mint operator*(const mint a) const { return mint(*this) *= a;}
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }

    // for prime mod
    mint inv() const { return pow(mod-2);}
    mint& operator/=(const mint a) { return *this *= a.inv();}
    mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}


template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; }}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; }}

ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}

// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
    vector<mint> fact, ifact;
    combination(int n):fact(n+1),ifact(n+1) {
        assert(n < mod);
        fact[0] = 1;
        for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
        ifact[n] = fact[n].inv();
        for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
    }
    mint operator()(int n, int k) {
        if (k < 0 || k > n) return 0;
        return fact[n]*ifact[k]*ifact[n-k];
    }
};

struct Edge {
    set<int> linked_node;
    int c;
};
struct Node {
    set<int> l;
};
struct Tx {
    int node, ex_color;
};

v<Edge> e;
map<int, Node> t;

void coloring(int root, int color) {
    queue<Tx> q;
    set<int> processed;
    q.push(Tx{root, color});

    while(!q.empty()) {
        Tx tx = q.front(); q.pop();

        int nc = 1;
        for (int edge_id: t[tx.node].l) {
            if (processed.count(edge_id)) continue;
            processed.insert(edge_id);
            if (nc == tx.ex_color) nc++;
            e[edge_id].c = nc;

            for (int next_node: e[edge_id].linked_node) {
                if (next_node == tx.node) continue;
                q.push(Tx{next_node, nc});
            }
            nc++;
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n; cin >> n;
    int a, b;
    rep(i, n-1) {
        cin >> a >> b;
        Edge edge;
        edge.linked_node.insert(a);
        edge.linked_node.insert(b);
        e.push_back(edge);
        t[a].l.insert(i);
        t[b].l.insert(i);
    }

    coloring(1, 0);
    int k = 0;
    rep(i, n-1) k = max(k, (int)t[i+1].l.size());
    cout << k << endl;

    rep(i, n-1) cout << e[i].c << endl;

    return 0;
}


Measured memory_bytes: 39244