#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=1<<30;

vector<int> G[MAX];

int dp[MAX];

int solve(int u,int p,int d){
    if(d%2==0){
        int re=0;
        for(int to:G[u]){
            if(to==p) continue;
            chmax(re,solve(to,u,d^1)+1);
        }
        return re;
    }else{
        int re=INF;
        for(int to:G[u]){
            if(to==p) continue;
            chmin(re,solve(to,u,d^1)+1);
        }
        if(re==INF) re=0;
        return re;
    }
}

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int N;cin>>N;
    for(int i=0;i<N-1;i++){
        int a,b;cin>>a>>b;a--;b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    
    cout<<solve(0,-1,0)<<endl;
    cout<<solve(0,-1,1)<<endl;

}