#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#pragma warning(disable:4996)
#pragma comment(linker, "/STACK:336777216")
using namespace std;

#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define ldb ldouble

typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;

int IT_MAX = 1 << 19;
int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;
#define szz(x) (int)(x).size()
#define rep(i, n) for(int i=0;i<n;i++)
#define Se second
#define Fi first

const int MX = 200005;

vector<int> T[MX];
int N, m, val = 1;

int dfs(int x, int p = -1){
	vector<int> X;
	for(int c : T[x]){
		if( c == p ) continue;
		X.push_back(dfs(c, x)+1);
	}
	sort(X.begin(), X.end());
	if( !val || X.empty() ) return 0;
	if( X.back() > m ) return val = 0;

	if( X.size()%2 == 0){
		int ch = 1;
		for(int i = 0; i < X.size()/2; i++){
			if( X[i] + X[X.size()-i-1] > m ) ch = 0;
		}
		if( ch ) return 0;
		if( p == -1 ) return val = 0;
		X.pop_back();
	}
	int ch = 1;
	for(int i = 0; i < X.size()/2; i++){
		if( X[i] + X[X.size()-i-2] > m ) ch = 0;
	}
	if( !ch ) val = 0;
	for(int i = X.size()-1; i > 0; i--){
		int op = X.size()/2 < i ? X.size()-i-1 : X.size()-i;
		if( X[i] + X[op] > m ) return X[i];
	}
	return X[0];
}

int main()
{
	int cnt = 1;
	scanf("%d", &N);
	for(int i = 1; i < N; i++){
		int a, b;
		scanf("%d%d", &a, &b);
		T[a].push_back(b);
		T[b].push_back(a);
	}
	for(int i = 1; i <= N; i++){
		if( T[i].size() >= 3 ) cnt += (T[i].size() - 1) / 2;
	}
	int s = 1, e = N;
	while(s <= e){
		m = (s+e) / 2;
		val = 1;
		dfs(1);
		if( val ) e = m-1;
		else s = m+1;
	}swap(s, e);
	printf("%d %d\n", cnt, e);
}
