import sequtils
template times*(n:int,body) = (for _ in 0..<n: body)
template `max=`*(x,y) = x = max(x,y)
template `min=`*(x,y) = x = min(x,y)
proc getchar_unlocked():char {. importc:"getchar_unlocked",header: "<stdio.h>" .}
proc scan(): int =
  while true:
    let k = getchar_unlocked()
    if k < '0': return
    result = 10 * result + k.ord - '0'.ord

proc findRoot(E:seq[seq[int]]) : int =
  var visited = newSeq[bool](E.len)
  proc visit(src:int) =
    visited[src] = true
    for dst in E[src]: visit(dst)
  for src in 0..<E.len:
    if not visited[src] :
      result = src
    visit(src)

let n = scan()
var E = newSeqWith(n,newSeq[int]())
(n-1).times: E[scan()-1] &= scan()-1
var preHasCutDP = newSeqWith(n,-1)
var preHasNotCutDP = newSeqWith(n,-1)
var time = 0
proc solve(preHasCut:bool,x:int):int =
  if E[x].len == 0 : return if preHasCut: 1 else: 0
  if preHasCut and preHasCutDP[x] != -1 : return preHasCutDP[x]
  if not preHasCut and preHasNotCutDP[x] != -1 : return preHasNotCutDP[x]
  time += 1
  var whenCut = 0
  for e in E[x]: whenCut += solve(true,e)
  var whenNotCut = 0
  for e in E[x]: whenNotCut += solve(false,e)
  if preHasCut : whenNotCut += 1
  result = max(whenCut,whenNotCut)
  if preHasCut:preHasCutDP[x] = result
  else: preHasNotCutDP[x] = result
let root = E.findRoot()
# proc getLen(x:int):int =
#   # echo x
#   for e in E[x] : result .max= getLen(e) + 1
# echo toSeq(0..100).mapIt(getLen(it))
echo solve(true,root)
# echo root.getLen()
# echo E.mapIt(it.len).max()