// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define TEST cerr << "TEST" << endl
#define AMARI 998244353
// #define AMARI 1000000007
#define TIME_LIMIT 1980000
#define el '\n'
#define El '\n'

vector<int> dist;
vector<vector<int>> g;
//dp[i] := 点iを根とする部分木について、そっから何手かかるか（ただし、先手後手は本当の根からの距離の偶奇に依存する）
vector<int> dp;

void dfs1(int p,int v){
    for(int i = 0; i < g[v].size(); i++){
        if(p == g[v][i])continue;
        dist[g[v][i]] = dist[v] + 1;
        dfs1(v,g[v][i]);
    }
    return;
}

void dfs2(int p,int v){
    if(g[v].size() == 1 && p != -1){
        dp[v] = 0;
        return;
    }
    if(dist[v] % 2 == 0){
        dp[v] = -1;
    }
    if(dist[v] % 2 == 1){
        dp[v] = INT_MAX / 2;
    }
    for(int i = 0; i < g[v].size(); i++){
        if(p == g[v][i])continue;
        dfs2(v,g[v][i]);
        if(dist[v] % 2 == 0){
            dp[v] = max(dp[v],dp[g[v][i]] + 1);
        }
        if(dist[v] % 2 == 1){
            dp[v] = min(dp[v],dp[g[v][i]] + 1);
        }
    }
}

void dfs3(int p,int v){
    if(g[v].size() == 1 && p != -1){
        dp[v] = 0;
        return;
    }
    if(dist[v] % 2 == 1){
        dp[v] = -1;
    }
    if(dist[v] % 2 == 0){
        dp[v] = INT_MAX / 2;
    }
    for(int i = 0; i < g[v].size(); i++){
        if(p == g[v][i])continue;
        dfs3(v,g[v][i]);
        if(dist[v] % 2 == 1){
            dp[v] = max(dp[v],dp[g[v][i]] + 1);
        }
        if(dist[v] % 2 == 0){
            dp[v] = min(dp[v],dp[g[v][i]] + 1);
        }
    }
}

#define MULTI_TEST_CASE false
void solve(void) {
    int n;
    cin >> n;
    g.resize(n);
    for(int i = 0; i < n - 1; i++){
        int u,v;
        cin >> u >> v;
        u--; v--;
        g[u].push_back(v); g[v].push_back(u);
    }
    if(n == 1){
        cout << 0 << el;
        cout << 0 << el;
        return;
    }
    dist.resize(n);
    dist[0] = 0;
    dfs1(-1,0);
    dp.resize(n);
    dfs2(-1,0);
    cout << dp[0] << el;
    dfs3(-1,0);
    cout << dp[0] << el;
    return;
}

void calc(void) {
    return;
}

signed main(void) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    calc();
    int t = 1;
    if(MULTI_TEST_CASE) cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}