#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// const ll MOD = 1e9+7;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

int ut = 0;
void dfs(vector<vector<int>>& g, vector<bool>& vis, int cur, int depth) {
	vis[cur] = true;
	ut = max(ut, depth);
	for (int i : g[cur]) {
		if (!vis[i]) {
			dfs(g, vis, i, depth+1);
		}
	}
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n; cin >> n;
    vector<vector<int>> g(n);
    for (int i = 0; i < n-1; i++) {
    	int u, v; cin >> u >> v;
    	u--; v--;
    	g[u].push_back(v); g[v].push_back(u);
    }
    
    int mx = 0, start = 0;
    for (int i = 0; i < n; i++) {
    	if (mx < (int) g[i].size()) {
    		mx = (int) g[i].size();
    	}
    	if ((int) g[i].size() == 1) start = i;
    }
    
    vector<bool> vis(n, false);
    dfs(g, vis, start, 1);
    
    cout << n-ut << " " << n-1-mx << "\n";

    return 0;
}