#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <array>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

const int N = 100010;
VI e[N];

bool good;
int c;

int iso(VI &a){
    int n = a.size();
    int ok = n-1, ng = -1;
    while (ok - ng > 1){
        int mi = (ok + ng) / 2;
        bool f = true;
        REP(i,n/2){
            int x = i;
            if (x >= mi) x++;
            int y = n - 1 - i;
            if (y <= mi) y--;
            if (a[x] + a[y] > c) f = false;
        }
        if (f) ok = mi;
        else ng = mi;
    }
    return a[ok];
}

int dfs(int now, int past){
    if (!good) return 0;
    VI a;
    for (int next : e[now]){
        if (next == past) continue;
        a.push_back(dfs(next, now) + 1);
    }
    sort(ALL(a));
    int n = a.size();
    // cout << now << " " << n << endl;
    if (n == 0) return 0;
    if (a.back() > c) good = false;
    if (n % 2 == 0){
        // cout << "even" << endl;
        bool f = true;
        REP(i,n/2){
            if (a[i] + a[n-1-i] > c) f = false;
        }
        if (f) return 0;
        a.pop_back();
        return iso(a);
    }
    REP(i,n/2){
        if (a[i] + a[n-2-i] > c) good = false;
    }
    return iso(a);
}

int main() {
    int n;
    cin >> n;
    REP(i,n-1){
        int a, b;
        scanf("%d %d", &a, &b);
        a--;b--;
        e[a].push_back(b);
        e[b].push_back(a);
    }

    int a = 0;
    REP(i,n) a += (e[i].size() % 2);
    a = (a + 1) / 2;

    int root;
    REP(i,n) if (e[i].size() == 1) root = i;

    // cout << "root" << root << endl;

    int ok = n, ng = 0;
    while (ok - ng > 1){
        c = (ok + ng) / 2;
        // cout << c << endl;
        good = true;
        dfs(root, -1);
        if (good) ok = c;
        else ng = c;
    }


    cout << a << " " << ok << endl;

    return 0;
}
