#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define INF (1 << 30)
#define LLINF (1LL << 60)
#define vi vector<int>
#define vvi vector<vector<int>>
#define pi pair<int, int>
#define ALL(a) (a).begin(), (a).end()
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //sortしてからつかうこと
constexpr ll MOD = 1e9 + 7;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
ll A, B, C, D, E, F, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S, T;
ll ans = 0;

template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec)
        is >> x;
    return is;
}

class Graph {
    struct edge {
        int from, to, cost;
        edge(int from, int to, int cost) : from(from), to(to), cost(cost) {}
    };

public:
    int verN;
    int edgeN = 0;
    bool single_source_flag = 0;
    vector<edge> edge_set;
    vector<vector<pair<int, int>>> adj_list;
    vector<vector<int>> dist_all_pairs;
    vector<int> dist_single_source;
    Graph(int verN) : verN(verN), adj_list(verN), dist_single_source(verN, INF) {}

    void add_directed_edge(int from, int to, int cost = 1) {
        edge_set.push_back(edge(from, to, cost));
        adj_list[from].push_back(make_pair(to, cost));
        edgeN++;
    }

    void add_undirected_edge(int from, int to, int cost = 1) {
        edge_set.push_back(edge(from, to, cost));
        edge_set.push_back(edge(to, from, cost));
        adj_list[from].push_back(make_pair(to, cost));
        adj_list[to].push_back(make_pair(from, cost));
        edgeN += 2;
    }

    bool bellmanford(int start) {
        single_source_flag = 1;
        vector<int> &d = dist_single_source;
        for (int i = 0; i < verN; i++) {
            d[i] = INF;
        }
        d[start] = 0;
        for (int i = 0; i < verN; i++) {
            for (int j = 0; j < edgeN; j++) {
                edge e = edge_set[j];
                if (d[e.from] != INF && d[e.to] > d[e.from] + e.cost) {
                    d[e.to] = d[e.from] + e.cost;
                    if (i == verN - 1) {
                        return false;
                    }
                }
            }
        }
        return true;
    }

    void dijkstra(int start) {
        single_source_flag = 1;
        vector<int> &d = dist_single_source;
        d[start] = 0;
        priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
        vector<int> used(verN, 0);
        pq.push(make_pair(0, start));
        while (!pq.empty()) {
            int now = pq.top().second;
            pq.pop();
            used[now] = 1;
            for (auto adj_pair : adj_list[now]) {
                int adj = adj_pair.first;
                int dist = adj_pair.second;
                if (used[adj])
                    continue;
                if (d[adj] > d[now] + dist) {
                    d[adj] = d[now] + dist;
                    pq.push(make_pair(d[adj], adj));
                }
            }
        }
    }

    void warshallfloyd() {
        dist_all_pairs.resize(verN, vector<int>(verN, INF));
        for (int i = 0; i < verN; i++) {
            for (auto adj_pair : adj_list[i]) {
                int adj = adj_pair.first;
                int dist = adj_pair.second;
                dist_all_pairs[i][adj] = dist;
            }
        }
        for (int k = 0; k < verN; k++) {         // 経由する頂点
            for (int i = 0; i < verN; i++) {     // 始点
                for (int j = 0; j < verN; j++) { // 終点
                    dist_all_pairs[i][j] = min(dist_all_pairs[i][j], dist_all_pairs[i][k] + dist_all_pairs[k][j]);
                }
            }
        }
    }

    int get_shortest_path(int end) {
        assert(single_source_flag == 1);
        return dist_single_source[end];
    }

    int get_shortest_path(int start, int end) {
        assert(dist_all_pairs.size() != 0);
        return dist_all_pairs[start][end];
    }
};

signed main() {
    cin >> N;
    Graph g(N);
    map<pair<int, int>, int> mp;
    for (int i = 0; i < N - 1; i++) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        g.add_undirected_edge(a, b);
        mp[{a, b}] = i;
        mp[{b, a}] = i;
    }
    for (int i = 0; i < g.adj_list.size(); i++) {
        ans = max((ll)g.adj_list[i].size(), ans);
    }
    queue<pair<int, int>> q;
    vi flag(N);
    vi color(N - 1);
    int prev_c;
    q.push({0, 0});
    while (!q.empty()) {
        int now = q.front().first;
        int prev_c = q.front().second;
        q.pop();
        int c = 1;
        flag[now] = 1;
        for (auto p : g.adj_list[now]) {
            int to = p.first;
            if (flag[to] == 0) {
                int tmp = mp[{now, to}];
                if (c == prev_c) {
                    c++;
                }
                color[tmp] = c;
                q.push({to, c});
                dump(now, to, c);
                c++;
            }
        }
    }
    cout << ans << endl;
    for (int i = 0; i < N - 1; i++) {
        cout << color[i] << endl;
    }
}

Measured memory_bytes: 22704