import sys
from itertools import permutations
from heapq import heappop,heappush
from collections import deque
import random
import bisect

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

def cmb(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    return (g1[n] * g2[r] % mod) * g2[n-r] % mod


mod = 998244353
N = 2*10**5
g1 = [1]*(N+1)
g2 = [1]*(N+1)
inverse = [1]*(N+1)

for i in range( 2, N + 1 ):
    g1[i]=( ( g1[i-1] * i ) % mod )
    inverse[i]=( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2[i]=( (g2[i-1] * inverse[i]) % mod )
inverse[0]=0

N = int(input())
if N == 1:
    print(0)
    print(0)
    exit()

edge = [[] for v in range(N)]
for _ in range(N-1):
    u,v = mi()
    edge[u-1].append(v-1)
    edge[v-1].append(u-1)

parent = [-1] * N
deq = deque([0])
topo = []
while deq:
    v = deq.popleft()
    topo.append(v)
    for nv in edge[v]:
        if nv == parent[v]:
            continue
        parent[nv] = v
        deq.append(nv)

INF = N + 100
"""
0:最大化 1:最小化
"""
dp = [[0,INF] for v in range(N)]
for v in topo[::-1]:
    for nv in edge[v]:
        if nv == parent[v]:
            continue
        dp[v][0] = max(dp[v][0],dp[nv][1]+1)
        dp[v][1] = min(dp[v][1],dp[nv][0]+1)
    if v!=0 and len(edge[v]) == 1:
        dp[v] = [0,0]


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