# 非再帰

import sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**6)
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')

##################

n = int(input())
G = [[] for _ in range(n)]
for _ in range(n-1):
  u, v = map(int, input().split())
  u -= 1
  v -= 1
  G[u].append(v)
  G[v].append(u)

def tree(G: list, root: int) -> list:
  "get topological_sort and dist."
  n = len(G)
  todo = [root]
  dist = [-1] * n
  order = [root]
  dist[root] = 0
  while todo:
    v = todo.pop()
    d = dist[v] + 1
    for x in G[v]:
      if dist[x] != -1:
        continue
      dist[x] = d
      todo.append(x)
      order.append(x)
  return (order, dist)

dp = [[0, 1] for _ in range(n)]
order, dist = tree(G, 0)

for v in order[::-1]:
  for x in G[v]:
    if dist[x] < dist[v]:
      continue
    dp[v][0] += max(dp[x][0], dp[x][1])
    dp[v][1] += max(dp[x][0], dp[x][1]-1)

print(max(dp[0]))