n = int(input())
e = [[] for i in range(n)]
for _ in range(n-1):
    a,b = [int(x)-1 for x in input().split()]
    e[a].append(b)
    e[b].append(a)


depth = [n]*n
q = [0]
topo = []
depth[0] = 0
while q:
    now = q.pop()
    topo.append(now)
    for nex in e[now]:
        if depth[nex] > depth[now]+1:
            depth[nex] = depth[now]+1
            q.append(nex)

def solve(f):
    dp = [-1]*n
    for now in topo[::-1]:

        d = depth[now]%2

        ## max
        if d == f:

            ma = 0

            for nex in e[now]:
                if depth[nex] > depth[now]:
                    ma = max(ma,dp[nex]+1)
            
            dp[now] = ma
            
            

        ## min
        else:
            mi = n+1
            for nex in e[now]:
                if depth[nex] > depth[now]:
                    mi = min(mi,dp[nex]+1)

            
            if mi == n+1:
                mi = 0
            dp[now] = mi
    return dp[0]


print(solve(0))
print(solve(1))