import sys
input = sys.stdin.readline

N=int(input())
E=[[] for i in range(N)]

for i in range(N-1):
    x,y=map(int,input().split())
    x-=1
    y-=1
    E[x].append(y)
    E[y].append(x)
    
# 木のHL分解+LCA

ROOT=0

QUE=[ROOT] 
Parent=[-1]*N
Parent[ROOT]=N # ROOTの親を定めておく.
Child=[[] for i in range(N)]
TOP_SORT=[] # トポロジカルソート

while QUE: # トポロジカルソートと同時に親を見つける
    x=QUE.pop()
    TOP_SORT.append(x)
    for to in E[x]:
        if Parent[to]==-1:
            Parent[to]=x
            Child[x].append(to)
            QUE.append(to)

Childs=[[0,0,0] for i in range(N)]

for x in TOP_SORT[::-1]:
    if Child[x]==[]:
        continue

    for c in Child[x]:
        Childs[x][0]+=1
        Childs[x][1]+=Childs[c][0]
        Childs[x][2]+=Childs[c][1]

ANS=0
for i in range(N):
    ANS+=Childs[i][0]+Childs[i][1]+Childs[i][2]

    SUM1=Childs[i][0]
    SUM2=Childs[i][1]

    for c in Child[i]:
        SUM1-=1
        ANS+=SUM1

        SUM2-=Childs[c][0]
        ANS+=SUM2

print(ANS)