#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>

using namespace std;
typedef unsigned int uint;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PP;
#define REP(i,a,n) for(LL i = (a); i < (LL)(n); ++i)
#define REM(i,a,n) for(LL i = ((n) - 1); i >= (a); --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP {cin.tie(0); ios::sync_with_stdio(false);}
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const string INFSTR = "\x7f";
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U>
istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U>
ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N>
void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template<class T>
T Compare(T left, T right) { return left > right ? 1 : (left < right ? -1 : 0); }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }
// all_of
// partial_sum, adjacent_difference

#ifdef ONLY_MY_ENVIR
#include "IntMod.h"
#include "Union_Find.h"
#include "Graph.h"
#include "Range.h"
#include "Global.h"
#include "Flow_Solver.h"
#include "Tree.h"
#include "Suffix_Array.h"
#include "Geometry.h"
#include "Matrix.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>> (istream& ist, __int128& val) { LL tmp;  ist >> tmp; val = tmp; return ist; }
ostream& operator<< (ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif

#if 1234567891
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>
template<typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T> >;	// コスト小を優先
#endif

int N;
vector<int> G[100000];

int DFS(int i, int prev, int len) {
	std::vector<int> lens;
	for (int to : G[i]) {
		if (to == prev) continue;
		lens.push_back(DFS(to, i, len) + 1);
	}

	if (lens.size() == 0) return 0;
	if (lens.size() % 2 == 0) lens.push_back(0);
	sort(lens.begin(), lens.end());

	int lo = -1;
	int hi = lens.size();
	while (lo + 1 < hi) {
		int mid = (lo + hi) / 2;
		int mx = 0;

		int l = 0;
		int r = lens.size() - 1;
		while (l < r) {
			if (l == mid) ++l;
			if (r == mid) --r;
			mx = max(mx, lens[l] + lens[r]);
			++l;
			--r;
		}
		if (mx <= len) {
			hi = mid;
		} else {
			lo = mid;
		}
	}
	return hi == lens.size() ? INF : lens[hi];
}

bool OK(int len) {
	int i = 0;
	while (G[i].size() != 1) {
		++i;
	}
	int a = DFS(i, -1, len);
	return a <= len;
}

int main() {
	cin >> N;
	REP(i, 0, N - 1) {
		int a, b;
		cin >> a >> b;
		--a; --b;
		G[a].push_back(b);
		G[b].push_back(a);
	}

	int ans = 1;
	REP(i, 0, N) {
		ans += (G[i].size() - 1) / 2;
	}

	int lo = 0;
	int hi = 100001;
	while (lo + 1 < hi) {
		int mid = (lo + hi) / 2;
		if (OK(mid)) {
			hi = mid;
		} else {
			lo = mid;
		}
	}

	cout << ans << ' ' << hi << endl;
	return 0;
}

Measured memory_bytes: 15104