#include <bits/stdc++.h>
#define range(i, l, r) for(long long int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (long long int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
    os << "(";
    os << p.first << ", " << p.second;
    return os << ")";
}

template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
    os << "[";
    if (v.size() == 0) return os << "]";
    for (int i = 0; i < v.size() - 1; i++) {
        os << v.at(i) << ", ";
    }
    return os << v.at(v.size() - 1) << "]";
}

template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

lint pow(lint num, lint e, lint MOD) {
    lint res = 1;
    lint cur_num = num;
    while (e) {
        if (e & 1) {
            res *= cur_num;
            res %= MOD;
        }
        cur_num *= cur_num;
        cur_num %= MOD;
        e >>= 1;
    }
    return res;
}

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    lint N; cin >> N;
    vec<vec<lint>> adj(N);
    vec<plint> edges(N - 1);
    range(i, 0, N - 1) {
        lint a, b; cin >> a >> b;
        a--; b--;
        adj.at(a).emplace_back(b);
        adj.at(b).emplace_back(a);
        edges.at(i) = {a, b};
    }
    map<plint, lint> color;
    color.emplace(make_pair(0, 0), 0);
    // cout << color << "\n";
    lint num_colors = 0;
    range(i, 0, N) num_colors = max(num_colors, (lint)adj.at(i).size());
    deque<plint> que;
    que.emplace_back(0, 0);
    while (!que.empty()) {
        plint edge = que.front();
        lint node, parent;
        tie(node, parent)= edge;
        que.pop_front();
        lint used_color = color.at(edge);
        // lint used_color = 0;
        lint cur_color = 1;
        for (const auto& child : adj.at(node)) {
            if (child == parent) continue;
            else if (cur_color == used_color) cur_color += 1;
            color.emplace(make_pair(node, child), cur_color);
            color.emplace(make_pair(child, node), cur_color);
            cur_color += 1;
            que.emplace_back(child, node);
        }
    }
    cout << num_colors << "\n";
    for (const auto& edge : edges) cout << color[edge] << '\n';
}

Measured memory_bytes: 20608