import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


N = I()
Graph = [[] for _ in range(N+1)]
for _ in range(N-1):
    u,v = MI()
    Graph[u].append(v)
    Graph[v].append(u)

dp0 = [0]*(N+1)
dp1 = [0]*(N+1)


def dp(i,par):
    children_0 = []
    children_1 = []
    for j in Graph[i]:
        if j == par:
            continue
        c0,c1 = dp(j,i)
        children_0.append(c0)
        children_1.append(c1)
    res1 = sum(children_0)
    res0 = res1
    C = len(children_0)
    for k in range(C):
        res0 = max(res0,res1-children_0[k]+children_1[k]+1)
    return res0,res1


ans,b = dp(1,0)
print(ans)