#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e5 + 5;
vector<int> tree[MAX_N];
vector<int> depth(MAX_N, 0);
vector<int> no_of_leafs(MAX_N, 0);
vector<int> parent(MAX_N, 0);
vector<int> is_leaf(MAX_N, false);
void dfs_depth(int v, int parent_v) {
  if (depth[v] != 0) return;
  parent[v] = parent_v;
  depth[v] = depth[parent_v] + 1;
  no_of_leafs[v] = (tree[parent_v].size() == 1 ? 1 : 0);
  for (int i = 0; i < tree[v].size(); i++) {
    int child_v = tree[v][i];
    if (child_v == parent_v) {
      continue;
    }
    dfs_depth(child_v, v);
    no_of_leafs[v] += (tree[child_v].size() == 1);
  }
}
int main() {
  int no_of_vertices;
  cin >> no_of_vertices;
  int no_of_edges = no_of_vertices - 1;
  for (int i = 1; i <= no_of_edges; i++) {
    int u, v;
    cin >> u >> v;
    tree[u].push_back(v);
    tree[v].push_back(u);
  }
  for (int i = 1; i <= no_of_vertices; i++) {
    if (tree[i].size() == 1) {
      is_leaf[i] = true;
    }
  }
  dfs_depth(1, 0);
  set<int> leaf_depth_parities;
  for (int i = 1; i <= no_of_vertices; i++) {
    if (is_leaf[i]) {
      leaf_depth_parities.insert(depth[i] % 2);
    }
  }
  int minimum_colours = (leaf_depth_parities.size() == 1 ? 1 : 3);
  int maximum_colours = no_of_edges;
  for (int v = 1; v <= no_of_vertices; v++) {
    if (no_of_leafs[v] >= 1) {
      maximum_colours++;
    }
    if (is_leaf[v]) {
      maximum_colours--;
    }
  }
  cout << minimum_colours << " " << maximum_colours << "\n";
  return 0;
}
