import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
n = int(input())
edge = [[] for i in range(n)]
nyuji = [0 for i in range(n)]
e = []
for i in range(n-1):
    u,v = map(int,input().split())
    u-=1
    v-=1
    edge[u].append(v)
    edge[v].append(u)
    nyuji[u] += 1
    nyuji[v] += 1
    e.append((u,v))
ans = 0
for u,v in e:
    ans += (nyuji[u]-1) * (nyuji[v] - 1 )
    ans += 1
for i in range(n):
    ans += nyuji[i]*(nyuji[i]-1)//2
print(ans)