import sys
readline = sys.stdin.readline
from collections import deque


def bfs(G, s, N):
    Q = deque([])
    dist = [-1] * N
    par = [-1] * N
    sz = [1] * N
    dist[s] = 0
    for u in G[s]:
        par[u] = s
        dist[u] = 1
        sz[u] += sz[s]
        Q.append(u)

    while Q:
        u = Q.popleft()
        for v in G[u]:
            if dist[v] != -1:
                continue
            dist[v] = dist[u] + 1
            par[v] = u
            sz[v] += sz[u]
            Q.append(v)
            
    return par

def topsort(G):
    Q = deque()
    N = len(G)
    count = [0] * N

    for u in range(N):
        for v in G[u]:
            count[v] += 1

    for u in range(N):
        if count[u] == 0:
            Q.append(u)
    anslst = []
    while Q:
        u = Q.pop()
        anslst.append(u)
        for v in G[u]:
            count[v] -= 1
            if count[v] == 0:
                Q.append(v)
    return anslst


N = int(readline())
G = [[] for i in range(N)]
a, b = [0] * (N - 1), [0] * (N - 1)
for i in range(N - 1):
    a[i], b[i] = map(int, input().split())
    a[i], b[i] = a[i] - 1, b[i] - 1
    G[a[i]].append(b[i])
    G[b[i]].append(a[i])

par = bfs(G, 0, N)
G2 = [[] for i in range(N)]
for i in range(N - 1):
    if par[a[i]] == b[i]:
        G2[a[i]].append(b[i])
    else:
        G2[b[i]].append(a[i])
G = topsort(G2)

dp0 = [0] * N
dp1 = [1] * N
for u in G:
    for v in G2[u]:
        dp0[v] += max(dp0[u], dp1[u])
        dp1[v] += max(dp0[u], dp1[u] - 1)
print(max(dp0[0], dp1[0]))