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)
box = set()
def f(i,pi,n):
    if n==1:
        if pi in G[i]:
            for j in G[i]:
                if j==pi:continue
                box.add(j)
        else:
            for j in G[i]:
                box.add(j)
        return
    for j in G[i]:
        if j==pi:continue
        f(j,i,n-1)
ans = set()
def dfs(i,pi,n):
    box.clear()
    f(i,0,n)
    for j in box:
        if i<j:
            ans.add((i,j))
        else:
            ans.add((j,i))
    for j in G[i]:
        if j==pi:continue
        dfs(j,i,n)
for i in range(1,N+1):
    if len(G[i])==1:
        ini = i
        break
for n in range(2,3+1):
    dfs(ini,0,n)
print(len(ans)+N-1)