#include <iostream>
#include <bits/stdc++.h>
using ll = long long;
using namespace std;

int main()
{
    ll n; cin >> n;
    vector<ll> fok(n, 0);
    for (int i = 0; i+1 < n; i++){
        ll x, y;
        cin >> x >> y;
        fok[x]++; fok[y]++;
    }
    ll ans1 = 0;
    for (int i = 0; i < n; i++){
        if (fok[i] > 2) ans1 += fok[i]-2;
    }
    ll maxfok = 0;
    for (int i = 0; i < n; i++){
        if (fok[i] > maxfok) maxfok = fok[i];
    }
    ll ans2 = n-1-maxfok;
    cout << ans1 << " " << ans2;
    return 0;
}