N=int(input())
edges=[]
graph=[[] for x in range(N)]
for i in range(N-1):
    u,v=map(int,input().split())
    u-=1;v-=1
    edges.append((u,v))
    graph[u].append(v)
    graph[v].append(u)
ans=N-1
for x in range(N):
    ans+=len(graph[x])*(len(graph[x])-1)//2
for u,v in edges:
    ans+=(len(graph[u])-1)*(len(graph[v])-1)
print(ans)