n = int(input())
g = [[] for _ in range(n)]
p = [False]*(n)
for _ in range(n-1):
    u, v = map(int, input().split())
    g[u-1].append(v-1)
    p[v-1] = True
r = 0
def dfs(u):
    a = sum(map(dfs, g[u]))
    if a == 0:
        return 1
    global r
    r += a
    return 0
dfs(p.index(False))
print(r+1)