#include<bits/stdc++.h>
using namespace std;
const int N = 100005;

int n, lim, ans, dt[N];

vector<int> adj[N], arr;

bool can (int C, int P) {
	for(auto &T : adj[C]) {
		if(T == P) continue;
		if(!can(T, C)) return false;
	}
	arr.clear();
	for(auto &T : adj[C]) {
		if(T == P) continue;
		if(dt[T]+1 > lim) return false;
		arr.push_back(dt[T]+1);
	}
	sort(arr.begin(), arr.end());
	int N = arr.size();
	if(N % 2 == 0) {
		bool F = false;
		for(int i=0;i<N/2;i++) {
			if(arr[i] + arr[N-1-i] > lim) F = true;
		}
		if(!F) {dt[C] = 0; return true;}
		arr.pop_back(); N--;
	}
	int S = 0, E = N;
	while(S<E) {
		int M = (S+E)/2, L = 0, R = N-1;
		bool F = false;
		while(1) {
			if(L == M) L++;
			if(R == M) R--;
			if(L >= R) break;
			if(arr[L] + arr[R] > lim) {F = true; break;}
			L++; R--;
		}
		F ? S = M+1 : E = M;
	}
	if(S == N) return false;
	dt[C] = arr[S];
	return true;
}

bool can () {
	if(!can(1, 0)) return false;
	return (adj[1].size() % 2 || dt[1] == 0);
}

int main()
{
	scanf("%d",&n);
	for(int i=1;i<n;i++) {
		int A, B;
		scanf("%d%d",&A,&B);
		adj[A].push_back(B);
		adj[B].push_back(A);
	}
	ans = n-1;
	for(int i=1;i<=n;i++) {
		ans -= (int)adj[i].size() / 2;
	}
	printf("%d ",ans);
	int S = 0, E = n;
	while(S<E) {
		lim = (S+E)/2;
		can() ? E = lim : S = lim+1;
	}
	printf("%d\n",S);
}
