#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
//#define Add(x, y) x = (x + (y)) % mod
//#define Mult(x, y) x = (x * (y)) % mod

struct edge{int to, cost, id;};

class Graph
{
public:
    int N;
    vector<vector<edge>> G;

    Graph(int N): N(N){
        G = vector<vector<edge>>(N, vector<edge>(0));
        dp.resize(N);
    }

    void add_Directed_edge(int from, int to, int cost = 1, int id = 0){
        G[from].push_back(edge({to, cost, id}));
    }

    void add_Undirected_edge(int v1, int v2, int cost = 1, int id = 0){
        add_Directed_edge(v1, v2, cost, id);
        add_Directed_edge(v2, v1, cost, id);
    }

    vec dp;
    bool dfs(int v, int B, int p = -1){
        vec val;
        for(auto e: G[v]) if(e.to != p){
            if(!dfs(e.to, B, v)) return false;
            val.pb(dp[e.to]);
        }
        Sort(val);
        if(p != -1){
            if(SZ(G[v]) % 2){
                val.pb(0);
                Sort(val);
            }
            int n = SZ(val);
            assert(n % 2);

            int i0 = -1, i1 = n;
            while(i1 - i0 > 1){
                int i = (i0 + i1) / 2;
                vec tmp;
                REP(j, n) if(j != i) tmp.pb(val[j]);
                bool f = true;
                REP(j, SZ(tmp) / 2) if(tmp[j] + tmp[SZ(tmp) - 1 - j] > B) f = false;
                if(f) i1 = i;
                else i0 = i;
            }
            if(i1 == n) return false;
            else dp[v] = val[i1] + 1;
            
        }else{
            if(val.back() > B) return false;
            if(SZ(G[v]) % 2) val.pop_back();
            REP(i, SZ(val) / 2) if(val[i] + val[SZ(val) - 1 - i] > B) return false;
        }
        return true;
    }

};

signed main(){

    int N; cin >> N;
    Graph G(N);
    REP(i, N - 1){
        int a, b; cin >> a >> b;
        G.add_Undirected_edge(a - 1, b - 1);
    }
    int cnt = 0;
    REP(i, N) if(SZ(G.G[i]) % 2) cnt++;
    //debug(cnt);

    int A = cnt / 2;
    int B0 = 0, B1 = N;
    while(B1 - B0 > 1){
        int B = (B0 + B1) / 2;
        if(G.dfs(0, B)) B1 = B;
        else B0 = B;
    }
    cout << A << " " << B1 << endl;

    return 0;
}


Measured memory_bytes: 23296