import sys
sys.setrecursionlimit(500000)

N = int(input())
G = [[] for _ in range(N)]
for _ in range(N-1):
    A,B = map(int,input().split())
    A-=1;B-=1 #0-index
    G[A].append(B)
    G[B].append(A)

P = [-1]*N
def dfs(v,par=-1):
    P[v] = 1
    for u in G[v]:
        if u == par: continue
        P[v] += dfs(u,v)
    return P[v]
dfs(0)
#print(P)
#S = sum(P)
global ans
ans = 0
def dfs2(v,par,S): #Sは今の合計
    global ans
    ans += S
    for u in G[v]:
        if u == par: continue
        pre_v = P[v]
        pre_u = P[u]
        P[v] = N - P[u]
        P[u] = N
        new_S = S - pre_u + P[v]
        dfs2(u,v,new_S)
        P[v] = pre_v
        P[u] = pre_u

dfs2(0,-1,sum(P))
print(ans)