import sys
from sys import stdin
sys.setrecursionlimit(1 << 25)

def main():
    n = int(stdin.readline())
    edges = [[] for _ in range(n + 1)]
    for _ in range(n - 1):
        u, v = map(int, stdin.readline().split())
        edges[u].append(v)
        edges[v].append(u)
    
    dp = [[0, 0] for _ in range(n + 1)]
    visited = [False] * (n + 1)
    
    def dfs(u, parent):
        visited[u] = True
        max_diff = -1
        total = 0
        for v in edges[u]:
            if v == parent:
                continue
            dfs(v, u)
            total += max(dp[v][0], dp[v][1])
            current_diff = dp[v][0] - max(dp[v][0], dp[v][1])
            if current_diff > max_diff:
                max_diff = current_diff
        
        dp[u][0] = total
        if max_diff == -1:
            dp[u][1] = 0
        else:
            dp[u][1] = total + max_diff + 1
    
    dfs(1, -1)
    print(max(dp[1][0], dp[1][1]))

if __name__ == "__main__":
    main()