#include <bits/stdc++.h>
using namespace std;
vector<int> mp[100009];
int d[100009], du[100009];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i < n; i++) {
    int k1, k2;
    cin >> k1 >> k2;
    mp[k1].push_back(k2);
    mp[k2].push_back(k1);
    du[k1]++;
    du[k2]++;
  }
  int beg1 = -1, beg2 = -1;
  for (int i = 1; i <= n; i++)
    if (du[i] == 1) {
      beg1 = i;
      break;
    }
  for (int i = 1; i <= n; i++)
    if (du[i] > 1) {
      beg2 = i;
      break;
    }
  queue<int> q1, q2;
  q1.push(beg2);
  q2.push(1);
  while (!q1.empty()) {
    int now = q1.front();
    q1.pop();
    int c = q2.front();
    q2.pop();
    d[now] = c;
    for (int i = 0; i < mp[now].size(); i++) {
      if (d[mp[now][i]] == 0) {
        q1.push(mp[now][i]);
        q2.push(c + 1);
      }
    }
  }
  int bo = 0, cun = -1;
  for (int i = 1; i <= n; i++) {
    if (du[i] == 1) {
      if (cun == -1) {
        cun = d[i] % 2;
      } else {
        if ((d[i] + cun) % 2 == 1) bo = 1;
      }
    }
  }
  if (bo == 0)
    cout << 1 << ' ';
  else
    cout << 3 << ' ';
  memset(d, 0, sizeof(d));
  int ans = n - 1;
  for (int i = 1; i <= n; i++) {
    int check = 0;
    for (int j = 0; j < mp[i].size(); j++) {
      if (du[mp[i][j]] == 1) {
        if (check == 0)
          check = 1;
        else
          ans--;
      }
    }
  }
  cout << ans << endl;
  return 0;
}
