#include <bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define pii pair<int,int>
#define pll pair<ll,ll>

#define rep(i,num,n) for(int i=num;i<(int)(n);i++) //for_loop
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,num,n) for(int i=num-1;i>=(int)(n);i--) //reverse_for>
#define in(x,a,b) (a<=x && x<b)//範囲
#define reo return 0
#define all(v) v.begin(),v.end()

#define INFI 1010000000
#define INFL 4000000000000000000
//#define ten(x) ((int)1e##x)
//#define tenll(x) ((ll)1e##x)
#define PI 3.14159265358979
//#define mint modint1000000007
#define mint modint998244353

bool chmin(ll &a,ll b){if(a>b){a=b;return true;}return false;}
bool chmax(ll &a,ll b){if(a<b){a=b;return true;}return false;}
bool chmin(int &a,int b){if(a>b){a=b;return true;}return false;}
bool chmax(int &a,int b){if(a<b){a=b;return true;}return false;}

int dx[]={0,0,1,-1};int dy[]={1,-1,0,0};
//int dx[]={1,1,1,0,0,-1,-1,-1},dy[]={1,0,-1,1,-1,1,0,-1};
//----------------------------
int main(){
    int n;cin>>n;
    vector<vector<int>>g(n);
    rep(i,1,n){
    int a,b;
    cin>>a>>b;
    a--,b--;
    g[a].push_back(b);
    g[b].push_back(a);
    }
    vector<bool>used(n,false),used2(n,false);
    used[0]=used2[0]=true;
    vector<vector<int>>dp(2,vector<int>(n,-INFI));
    rep(i,0,n)dp[0][i]=INFI;
    //木DP
    auto dfs=[&](auto f,int pos)->int{

        bool leaf=false;
        int mi=INFI,ma=-INFI;
        for(auto to:g[pos]){
            if(used[to])continue;
            used[to]=true;
            leaf=true;
            f(f,to);//再帰
            chmin(dp[0][pos],dp[1][to]+1);
            chmax(dp[1][pos],dp[0][to]+1);
            
            
        }
        //ボトムケース
        if(!leaf){
            dp[0][pos]=dp[1][pos]=0;
        }
        return 0;
    };
    dfs(dfs,0);
    cout<<dp[1][0]<<endl<<dp[0][0]<<endl;
    reo;


}