import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;
import std.container;

enum MAX = 1_000_100;
ulong MOD = 1_000_000_007;
ulong INF = 1_000_000_000_000;
alias sread = () => readln.chomp();
alias Pair = Tuple!(long, "a", long, "b");
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);

void main()
{
    auto n = lread();
    auto G = new long[][](n, 0);
    auto P = new Pair[](n - 1);
    foreach (i; iota(n - 1))
    {
        long a, b;
        scan(a, b);
        a--, b--;
        G[a] ~= b, G[b] ~= a;
        P[i] = Pair(a, b);
    }
    long root;
    iota(1, n).each!(x => root = G[x].length > G[root].length ? x : root);
    G[root].length.writeln();
    auto edge = new long[long][](n);
    auto Q = DList!long(root);
    while (!Q.empty)
    {
        auto current = Q.front();
        Q.removeFront();
        long used, cnt = 1;
        if (!edge[current].keys.array.empty)
            used = edge[current][edge[current].keys[0]];
        foreach (g; G[current])
        {
            if (g in edge[current])
                continue;

            if (cnt == used)
                cnt++;
            
            edge[current][g] = edge[g][current] = cnt++;
            Q.insertBack(g);
        }
    }
    // edge.writeln();
    foreach(p; P)
        writeln(edge[p.a][p.b]);
}

T lread(T = long)()
{
    return readln.chomp.to!T();
}

T[] aryread(T = long)()
{
    return readln.split.to!(T[])();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}
