def topological_sorted(tree, root=None):
    n = len(tree)
    par = [-1] * n
    tp_order = []
    for v in range(n):
        if par[v] != -1 or (root is not None and v != root):
            continue
        stack = [v]
        while stack:
            v = stack.pop()
            tp_order.append(v)
            for nxt_v in tree[v]:
                if nxt_v == par[v]:
                    continue
                par[nxt_v] = v
                stack.append(nxt_v)
    return tp_order, par


n = int(input())
edges = [list(map(int, input().split())) for i in range(n - 1)]


tree = [[] for i in range(n)]
for u, v in edges:
    u -= 1
    v -= 1
    tree[u].append(v)
    tree[v].append(u)

tp_order, par = topological_sorted(tree, 0)
dp0 = [0] * n
dp1 = [0] * n

for v in tp_order[::-1]:
    for nxt_v in tree[v]:
        if nxt_v == par[v]:
            continue
        dp0[v] += max(dp0[nxt_v], dp1[nxt_v])
        dp1[v] += max(dp0[nxt_v], dp1[nxt_v] - 1)
    dp1[v] += 1

print(max(max(dp0), max(dp1)))