import sys
sys.setrecursionlimit(10**8)

def dfs(v,nums):
    nums[v] = [0,0]
    if len(edge[v])==0:
        return
    for u in edge[v]:
        if nums[u] == -1:
            dfs(u,nums)
        nums[v][0] += sum(nums[u])+1
        nums[v][1] += nums[u][1]+1
    return

N = int(input())
edge = [[] for _ in range(N)]
for i in range(N-1):
    a,b = map(int, input().split())
    edge[a-1].append(b-1)
nums = [-1]*N
for i in range(N):
    if nums[i] == -1:
        dfs(i,nums)
ans = 0
for i in range(N):
    ans += nums[i][0]
print(ans)