import sys
sys.setrecursionlimit(sys.getrecursionlimit()*100)

n = int(input())
g = [[] for _ in range(n)]
for _ in range(n-1):
    u, v = map(int, input().split())
    g[u-1].append(v-1)
    g[v-1].append(u-1)

dp = [[-1]*n, [-1]*n]
def dfs(i, j, p):
    if dp[i][j] >= 0:
        return dp[i][j]
    dp[i][j] = 0
    for k in g[j]:
        if k == p:
            continue
        dp[i][j] += max(
            dfs(1, k, j)+1-i,
            dfs(0, k, j))
    return dp[i][j]

print(max(dfs(0, 0, 0), dfs(1, 0, 0))+1)