exec({'RUBY_THREAD_VM_STACK_SIZE'=>'100000000'},'/usr/bin/ruby', $0) if !ENV['RUBY_THREAD_VM_STACK_SIZE']

require 'prime'

def inpf() a=gets.chomp.split(" ").map(&:to_f)end

def inps() a=gets.chomp.split(" ")end

def copy(a) Marshal.load(Marshal.dump(a)) end

def kaijo(n,r = 10**9+7)(n < 2)? 1 : (2..n).inject{|memo,u|memo=(memo*u)%r} end

def na(n,d=0) Array.new(n,d)end

def na2(n,m,d=0) Array.new(n){Array.new(m,d)}end

def na3(n,m,l,d=0) Array.new(n){Array.new(m){Array.new(l,d)}}end

def inp() a=gets.chomp.split(" ").map(&:to_i)end

def r_up(a, b) (a+b-1)/b end

def sum(a) a.inject(:+) end

def big(a,b) return (a>b)? a:b end

def small(a,b) return (a<b)? a:b end

def dfs(i,ng,par)
  color = 1
  @t[i].each do |a|
    next if a[0] == par
    color += 1 if color == ng
    dfs(a[0],color,i)
    @ans[a[1]] = color
    color += 1
  end
  @c = big(@c,color)
end

@c = 0
n = inp[0]
@ans = na(n-1)
d = []
@t = na2(n+1,0)
(n-1).times{ |i|
  l,r = inp
  @t[l].push([r,i])
  @t[r].push([l,i])
}
dfs(1,1e20,1e20)
p @c-1
puts @ans