import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques,heapqueue
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
  return int(c) - int('0')




proc solve()=
  var 
    n = scan()
    es = newseqwith(n,newseq[int]())
    ccnt = newseqwith(n,newseq[int]())
    depth = newseqwith(n,0)
    fp = newseqwith(n,false)
    ans = newseqwith(n,0)
  for i in 0..<n-1:
    var
      a = scan()-1
      b = scan()-1
    es[a].add(b)
    ccnt[a].add(0)
    es[b].add(a)
    ccnt[b].add(0)

  # 各頂点の子要素の個数と深さ
  proc dfs(s:int):(int,int)=# 個数、深さ
    result=(1,1)
    fp[s]=true
    for idx,nxt in es[s]:
      if fp[nxt]:continue
      var (c,d) = dfs(nxt)
      depth[s].max=d+1
      ccnt[s][idx]=c
      result[0]+=c
    result[1]=depth[s]
    return result

  var score = 0
  proc dfs2(s:int,num:int)=
    #echo fmt"{s} , {num}, {score}"
    ans[s] = num
    # s:現在の頂点番号
    # num:現在の頂点の値
    var
      # q:(子要素の深さ,子頂点)
      q = initHeapQueue[(int,int)]()
    var tnum = num
    fp[s] = true
    for idx, nxt in es[s]:
      if fp[nxt]:continue
      q.push((depth[nxt]+1,idx))
    var
      lastdepth:int = 0
      cnt:int
      nxt:int
    while q.len>0:
      var (dpt,idx) = q.pop()
      cnt = ccnt[s][idx]
      nxt = es[s][idx]
      score+=1+lastdepth
      dfs2(nxt,tnum+1)
      
      lastdepth = dpt
      tnum+=cnt
    
      


  


  discard dfs(0)
  #echo ccnt
  #echo depth
  fp.fill(false)
  dfs2(0,0)
  echo score
  #echo ans


solve()