#include <bits/stdc++.h>
using namespace std;
int n;
int du[100005] = {0};
int path[100005], cnt = 0, visited[100005] = {0};
vector<int> my_map[100005];
struct node {
  int xx, step;
};
void bfs(int now) {
  memset(path, -1, sizeof(path));
  path[now] = 0;
  queue<node> q;
  node into;
  into.xx = now;
  into.step = 0;
  q.push(into);
  while (!q.empty()) {
    node first = q.front();
    q.pop();
    int siz = my_map[first.xx].size();
    for (int i = 0; i < siz; ++i) {
      if (path[my_map[first.xx][i]] > 0) continue;
      into.xx = my_map[first.xx][i];
      into.step = first.step + 1;
      path[my_map[first.xx][i]] = into.step;
      q.push(into);
    }
  }
}
int main() {
  cin >> n;
  for (int i = 1; i < n; ++i) {
    int a, b;
    cin >> a >> b;
    ++du[a];
    ++du[b];
    my_map[a].push_back(b);
    my_map[b].push_back(a);
  }
  int s;
  for (int i = 1; i <= n; ++i)
    if (du[i] == 1) {
      s = i;
    }
  bfs(s);
  int flag = 0;
  for (int i = 1; i <= n; ++i) {
    int f = 0;
    int siz = my_map[i].size();
    for (int j = 0; j < siz; ++j)
      if (du[my_map[i][j]] == 1) ++f;
    if (f > 1) cnt += (f - 1);
    if (du[i] > 1 || i == s) continue;
    flag |= (path[i] & 1);
  }
  printf("%d %d\n", flag ? 3 : 1, n - 1 - cnt);
  return 0;
}
