import sys
input = sys.stdin.readline

sys.setrecursionlimit(10 ** 6)


N=int(input())
edge = [[] for _ in range(N)]
XY=[list(map(int,input().split())) for _ in range(N-1)]
for x,y in XY:
    x,y=x-1,y-1
    edge[x].append(y)
    edge[y].append(x)
visit = [0]*N

from heapq import *

def dfs(v=0,na=0):
    visit[v]=1
    n_tree = []
    if len(edge[v])<2:na+=1
    for to in edge[v]:
        if visit[to]:continue
        n,lst = dfs(to,na)
        heappush(n_tree,-n)
        while lst:
            heappush(n_tree,heappop(lst))
    ret = 1
    for i in range(min(2,len(n_tree))):
        ret += -heappop(n_tree)
    ret_tree = []
    while na and n_tree:
        heappush(ret_tree,heappop(n_tree))
        na-=1
    return ret,n_tree

ans,_ = dfs()
print(ans)