def dfs(start=0,goal=None):
    parents={}
    p,t=start,0
    parents[p]=-2
    next_set=[(~p,t),(p,t)]
    if p==goal:
        return t
    while next_set:
        p,t=next_set.pop()
        if p>=0:
            for q in edges[p]:
                if q in parents:
                    continue
                if q==goal:
                    return t+1
                parents[q]=p
                next_set.append((~q,t+1))
                next_set.append((q,t+1))
        else: # 帰りがけ処理
            p=~p
            for q in edges[p]:
                dp[0][p]+=max(dp[1][q],dp[0][q])
                dp[1][p]+=dp[0][q]
            dp[1][p]+=1
    return -1

N=int(input())

edges=[[] for _ in range(N)]
for _ in range(N-1):
    a,b=map(int, input().split())
    a,b=a-1,b-1
    edges[a].append(b)
    edges[b].append(a)

dp=[[0]*N for _ in range(2)]

dfs(start=0,goal=None)

print(max(dp[0][0],dp[1][0]))