import numpy as np
class sol(object):
    def __init__(self, N, tree):
        self.N = N
        self.tree = tree
        self.dp = np.ndarray([N,2], dtype=int)
        self.visit_cnt = [0] * N
        self.parent = np.array([-1] * N, dtype=int)
    
    def dns(self, cur):
        h = []
        h.append(cur)
        childs = [[] for i in range(self.N)]
        while len(h) > 0:
            v = h.pop()
            self.visit_cnt[v] += 1
            if self.visit_cnt[v] -1 < len(self.tree[v]):
                child = self.tree[v][self.visit_cnt[v] -1]
                if child != self.parent[v]:
                    h.append(v)
                    h.append(child)
                    childs[v].append(child)
                    self.parent[child] = v
                else:
                    h.append(v)
            else:
                if len(childs[v]) > 0:
                    t_dp = self.dp[childs[v]]
                    self.dp[v, 1] = np.sum(np.max(t_dp, axis=1))
                    t_dp[:,0] -= 1
                    self.dp[v, 0] = 1 + np.sum(np.max(t_dp, axis=1))
                else:
                    self.dp[v,1] = 0
                    self.dp[v,0] = 1
        return

    def ans(self):
        self.dns(0)
        return max(self.dp[0,0],self.dp[0,1])


def main():
    N=int(input())
    tree = [[] for i in range(N)]
    for i in range(N -1):
        e = list(map(int, input().split()))
        tree[e[0] -1].append(e[1] -1)
        tree[e[1] -1].append(e[0] -1)
    print(sol(N, tree).ans())

line_prof = False
if line_prof:
    from line_profiler import LineProfiler
    profiler = LineProfiler()
    profiler.add_function(sol.dns)
    profiler.runcall(main)
    profiler.print_stats()
else:
    main()