#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000;
int main(){
  int N;
  cin >> N;
  vector<vector<int>> E(N);
  for (int i = 0; i < N - 1; i++){
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    E[a].push_back(b);
    E[b].push_back(a);
  }
  vector<int> p(N, -1);
  vector<vector<int>> c(N);
  vector<int> b;
  queue<int> Q;
  Q.push(0);
  while (!Q.empty()){
    int v = Q.front();
    Q.pop();
    b.push_back(v);
    for (int w : E[v]){
      if (w != p[v]){
        p[w] = v;
        c[v].push_back(w);
        Q.push(w);
      }
    }
  }
  reverse(b.begin(), b.end());
  vector<int> mn(N, INF), mx(N, -INF);
  for (int v : b){
    if (c[v].empty()){
      mn[v] = 0;
      mx[v] = 0;
    } else {
      for (int w : c[v]){
        mn[v] = min(mn[v], mx[w] + 1);
        mx[v] = max(mx[v], mn[w] + 1);
      }
    }
  }
  cout << mx[0] << endl;
  cout << mn[0] << endl;
}