#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>

#include <atcoder/all>
#else
#include <mylibs/all.h>
#endif

using ll = long long;
using lll = __int128_t;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define repc2(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define length(v) ((int)(v).size())
constexpr int inf = 2'000'000'000;
constexpr ll linf = 4'000'000'000'000'000'000, M7 = 1'000'000'007, M9 = 998'244'353;
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
using namespace atcoder;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    struct edge {
        int to;
        edge(int to) : to(to) {}
    };
    vector<vector<edge>> G(n);
    rep(i, n - 1) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        G[a].emplace_back(b);
        G[b].emplace_back(a);
    }
    vector<bool> seen(n);
    vector<int> mx(n), mn(n, inf);
    auto dfs = [&](auto dfs, int u) -> void {
        seen.at(u) = true;
        int cnt = 0;
        for (const auto& e : G.at(u)) {
            if (seen.at(e.to)) continue;
            dfs(dfs, e.to);
            mx.at(u) = max(mx.at(u), mn.at(e.to) + 1);
            mn.at(u) = min(mn.at(u), mx.at(e.to) + 1);
            cnt++;
        }
        if (cnt == 0) mx.at(u) = mn.at(u) = 0;
    };
    dfs(dfs, 0);
    cout << mx.at(0) << endl;
    cout << mn.at(0) << endl;
    return 0;
}