// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;cin>>n;
    vector<vector<int>> a(n);
    vector<int> befok(n);
    for(int i=0;i<n-1;i++){
        int x, y;cin>>x>>y;
        x--;y--;
        a[x].push_back(y);
        a[y].push_back(x);
        befok[x]++;
        befok[y]++;
    }
    int maxi1=0;
    for(int i=0;i<n;i++){
        if(befok[i]>2){
            maxi1+=befok[i]-2;
        }
    }
    cout<<maxi1<<' ';
    int maxi=0;
    for(int i=0;i<n;i++){
        maxi=max(maxi, befok[i]);
    }
    cout<<n-maxi-1<<'\n';
}