import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**5+10)
from collections import *

def dfs1(v, pv):
    for nv in G[v]:
        if nv==pv:
            continue
        
        dfs1(nv, v)
        num[v] += num[nv]

def dfs2(v, pv):
    for nv in G[v]:
        if nv==pv:
            continue
        
        ans[nv] = ans[v]+N-2*num[nv]
        dfs2(nv, v)
    
N = int(input())
G = [[] for _ in range(N)]

for _ in range(N-1):
    A, B = map(int, input().split())
    G[A-1].append(B-1)
    G[B-1].append(A-1)
    
num = [1]*N
dfs1(0, -1)
ans = [-1]*N
ans[0] = sum(num)
dfs2(0, -1)
print(sum(ans))