using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var map = NMap(n - 1);
        var tree = new List<int>[n];
        for (var i = 0; i < tree.Length; ++i) tree[i] = new List<int>();
        foreach (var edge in map)
        {
            tree[edge[0]].Add(edge[1]);
            tree[edge[1]].Add(edge[0]);
        }
        var len1 = new int[n];
        var len2 = new int[n];
        DFS(-1, 0, 0, tree, len1, len2);
        WriteLine($"{len1[0]}\n{len2[0]}");
    }
    static void DFS(int prev, int cur, int dep, List<int>[] tree, int[] len1, int[] len2)
    {
        var max = 0;
        var min = int.MaxValue / 2;
        foreach (var next in tree[cur])
        {
            if (prev == next) continue;
            DFS(cur, next, dep + 1, tree, len1, len2);
            if (dep % 2 == 0)
            {
                max = Math.Max(max, len1[next] + 1);
                min = Math.Min(min, len2[next] + 1);
            }
            else
            {
                max = Math.Max(max, len2[next] + 1);
                min = Math.Min(min, len1[next] + 1);
            }
        }
        if (min == int.MaxValue / 2) min = 0;
        if (dep % 2 == 0)
        {
            len1[cur] = max;
            len2[cur] = min;
        }
        else
        {
            len1[cur] = min;
            len2[cur] = max;
        }
    }
}