/* -*- coding: utf-8 -*-
 *
 * 2532.cc:  No.2532 Want Play More - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 200000;
const int INF = 1 << 30;

/* typedef */

typedef vector<int> vi;

/* global variables */

vi nbrs[MAX_N];
int ps[MAX_N], cis[MAX_N], dp0[MAX_N], dp1[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    u--, v--;
    nbrs[u].push_back(v);
    nbrs[v].push_back(u);
  }

  if (n == 1) { printf("0\n0\n"); return 0; }
  
  fill(dp1, dp1 + n, INF);
  ps[0] = -1;

  for (int u = 0; u >= 0;) {
    vi &nbru = nbrs[u];
    int up = ps[u];

    if (cis[u] < nbru.size()) {
      int v = nbru[cis[u]++];
      if (v != up) {
	ps[v] = u;
	u = v;
      }
    }
    else {
      if (u > 0 && nbru.size() == 1)
	dp0[u] = dp1[u] = 0;
      if (up >= 0) {
	dp0[up] = max(dp0[up], dp1[u] + 1);
	dp1[up] = min(dp1[up], dp0[u] + 1);
      }
      u = up;
    }
  }

  printf("%d\n%d\n", dp0[0], dp1[0]);
  
  return 0;
}