# 非再帰

import sys
input = lambda: sys.stdin.readline().rstrip()

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

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)

class Tree:

  def __init__(self, G: list, n: int):
    self.n = n
    self.G = G
    self.toposo = []
    self.dist = []

  def _calc_dist_toposo(self, root: int) -> None:
    todo = [root]
    self.dist = [-1] * self.n
    self.dist[root] = 0
    self.toposo = [root]
    while todo:
      v = todo.pop()
      d = self.dist[v] + 1
      for x in self.G[v]:
        if self.dist[x] != -1:
          continue
        self.dist[x] = d
        todo.append(x)
        self.toposo.append(x)

  def get_dist(self, root: int) -> list:
    "return dist."
    if self.dist:
      return self.dist
    self._calc_dist_toposo(root)
    return self.dist

  def get_toposo(self, root: int) -> list:
    "return dist."
    if self.toposo:
      return self.toposo
    self._calc_dist_toposo(root)
    return self.toposo

tree = Tree(G, n)

dp = [[0, 1] for _ in range(n)]
order = tree.get_toposo(0)
dist = tree.get_dist(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]))