#include <bits/stdc++.h>
inline __attribute__((always_inline)) void init_io() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cout.tie(nullptr);
  std::fixed(std::cout).precision(10);
}
template <typename... Args>
inline __attribute__((always_inline)) bool read(Args&... args) {
  return (bool)(std::cin >> ... >> args);
}
template <typename... Args>
inline __attribute__((always_inline)) void write(Args&&... args) {
  (std::cout << ... << std::forward<Args>(args));
}
template <class... Args>
inline __attribute__((always_inline)) void writeln(Args&&... args) {
  write(std::forward<Args>(args)..., '\n');
}
inline __attribute__((always_inline)) void flush() { std::flush(std::cout); }
constexpr int8_t operator""_i8(unsigned long long val) { return val; }
constexpr uint8_t operator""_u8(unsigned long long val) { return val; }
constexpr int16_t operator""_i16(unsigned long long val) { return val; }
constexpr uint16_t operator""_u16(unsigned long long val) { return val; }
constexpr int32_t operator""_i32(unsigned long long val) { return val; }
constexpr uint32_t operator""_u32(unsigned long long val) { return val; }
constexpr int64_t operator""_i64(unsigned long long val) { return val; }
constexpr uint64_t operator""_u64(unsigned long long val) { return val; }
using graph_t = std::vector<std::vector<int>>;
bool is_all_path_to_leafs_even(const graph_t& g, int v, int p,
                               bool even = true) {
  if (g[v].size() == 1 && !even) return false;
  for (int u : g[v]) {
    if (u == p) continue;
    if (!is_all_path_to_leafs_even(g, u, v, !even)) return false;
  }
  return true;
}
int main() {
  init_io();
  int n;
  read(n);
  graph_t g(n);
  for (int i = 1; i < n; ++i) {
    int a, b;
    read(a, b);
    --a, --b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  std::vector<char> is_leaf(n, false);
  int leaf = -1;
  int leaf_cnt = 0;
  for (int i = 0; i < n; ++i) {
    if (g[i].size() == 1) {
      leaf = i;
      leaf_cnt += 1;
      is_leaf[i] = true;
    }
  }
  assert(leaf != -1);
  int max_res = n - leaf_cnt - 1;
  for (int i = 0; i < n; ++i) {
    int leaf_neighbours = 0;
    for (int u : g[i]) leaf_neighbours += is_leaf[u];
    if (leaf_neighbours == 0) continue;
    max_res += 1;
  }
  const int min_res = 3 - 2 * is_all_path_to_leafs_even(g, leaf, -1);
  writeln(min_res, ' ', max_res);
  return 0;
}
