N = int(input())
G = {i:[] for i in range(1,N+1)}
for _ in range(N-1):
    u,v = map(int,input().split())
    G[u].append(v)
    G[v].append(u)
def f(i,pi,n):
    if n==1:
        cnt = 0
        for j in G[i]:
            if j==pi:continue
            cnt += 1
        return cnt+1
    cnt = 0
    for j in G[i]:
        if j==pi:continue
        cnt += f(j,i,n-1)
    if n==2:
        return cnt+1
    return cnt
ans = 0
def dfs(i,pi):
    global ans
    ans += f(i,0,3)
    for j in G[i]:
        if j==pi:continue
        dfs(j,i)
dfs(1,0)
print(ans//2)