const int N = 400005;
const int LG = 21;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <unordered_set>
#include <bitset>
#include <deque>

using namespace std;

#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;

#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())

#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL

int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};

ll inq(ll x, ll y)
{
    if (!y) re 1 % MOD;
    ll l = inq(x, y / 2);
    if (y % 2) re l * l % MOD * x % MOD;
    re l * l % MOD;
}

ll rev(ll x)
{
    return inq(x, MOD - 2);
}

bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;

void __precompute_combinatorics()
{
    __precomputed_combinatorics = 1;
    __fact.resize(N);
    __ufact.resize(N);
    __rev.resize(N);
    __rev[1] = 1;
    for (int i = 2; i < N; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
    __fact[0] = 1, __ufact[0] = 1;
    for (int i = 1; i < N; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}

ll fact(int x)
{
    if (!__precomputed_combinatorics) __precompute_combinatorics();
    return __fact[x];
}

ll cnk(int n, int k)
{
    if (!__precomputed_combinatorics) __precompute_combinatorics();
    return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}

int n;
vector<int> graph[N];
int root;
int A, t;
int beginning;

int find_value(vector<int> &dp, int M)
{
    int L = -1, R = dp.size();
    while (L + 1 < R)
    {
        int mid = (L + R) / 2;
        int j = dp.size() - 1;
        int t = 1;
        for (int i = 0; i < j; )
        {
            if (i == mid) i++;
            if (j == mid) j--;
            if (dp[i] + dp[j] > M) t = 0;
            i++, j--;
        }
        if (t) R = mid;
        else L = mid;
    }
    if (R == dp.size()) return -1;
    return dp[R];
}

int dfs(int v, int p, int M)
{
    vector<int> dp;
    for (auto u : graph[v]) if (u != p)
    {
        dp.push_back(dfs(u, v, M));
        if (dp.back() == M)
        {
            dp.pop_back();
            beginning++;
        }
    }
    if (dp.size() % 2 == 0) dp.push_back(0), beginning++;
    sort(all(dp));
    int x = find_value(dp, M) + 1;
    if (x == 0)
    {
        beginning += dp.size();
        x = 1;
    }
    if (x == M + 1) x = 1, beginning += 2;
    //cout << "vertex " << v << " " << x << "\n";
    return x;
}

int check(int M)
{
    if (M == 1)
    {
        return (A == n - 1);
    }
    t = 0;
    beginning = 0;
    int cat = dfs(root, root, M);
    if (cat == 1) beginning--;
    //cout << "if M = " << M << " " << beginning << "\n";
    if ((beginning + 1) / 2 <= A) return 1;
    return 0;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for (int i = 0; i < n - 1; i++)
    {
        int a, b;
        cin >> a >> b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }
    int cnt_odd = 0;
    for (int i = 1; i <= n; i++)
    {
        if (graph[i].size() == 1) root = i;
        cnt_odd += (graph[i].size() % 2);
    }
    cout << (cnt_odd + 1) / 2 << " ";
    A = (cnt_odd + 1) / 2;
    int L = 0, R = n;
    while (L + 1 < R)
    {
        int M = (L + R) / 2;
        if (check(M)) R = M;
        else L = M;
    }
    cout << R;
}

/* Note:
Check constants at the beginning of the code.
N is set to 4e5 but be careful in problems with large constant factor.
Check corner cases.
No def int long long for now.
*/


Measured memory_bytes: 22144