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

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

stack = [(0,-1,0)]
while stack:
    now,parent,f = stack.pop()
    if f == 0:
        stack.append((now,parent,1))
        for i in G[now]:
            if i == parent:continue
            stack.append((i,now,0))
        continue

    M = 0
    m = 10 ** 6
    count = 0
    for v in G[now]:
        if v == parent:continue
        count += 1
        if dp[v][1] > M:M = dp[v][1]
        if dp[v][0] < m:m = dp[v][0]
    if count == 0:
        M = 0
        m = 0
    dp[now][0] = M + 1
    dp[now][1] = m + 1
print(dp[0][0] - 1)
print(dp[0][1] - 1)
    
#print(dp)