#include <bits/stdc++.h>
using namespace std;
int visited[100001];
vector<int> graph[100001];
int flag = 0;
int leaf[100001];
int depth[100001];
int direct_leaf_parent[100001];
void add_edge(int x, int y) {
  graph[x].push_back(y);
  graph[y].push_back(x);
}
void dfs(int u, int d) {
  visited[u] = 1;
  depth[u] = d;
  if (graph[u].size() == 1) leaf[u] = 1;
  for (int i : graph[u]) {
    if (graph[i].size() == 1) direct_leaf_parent[u] += 1;
    if (!visited[i]) dfs(i, d + 1);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  cin >> n;
  int x, y;
  for (int i = 0; i < n - 1; i++) {
    cin >> x >> y;
    add_edge(x, y);
  }
  dfs(1, 1);
  vector<int> v;
  int min_ans = 0, max_ans = n - 1;
  int odd = 0, even = 0, count = 0;
  for (int i = 1; i <= n; i++) {
    if (leaf[i] == 1) {
      if (depth[i] % 2 == 0)
        even = 1;
      else
        odd = 1;
    }
    if (direct_leaf_parent[i] > 1) {
      max_ans -= direct_leaf_parent[i];
      max_ans += 1;
    }
  }
  if (odd == 1 && even == 1)
    min_ans = 3;
  else
    min_ans = 1;
  cout << min_ans << " " << max_ans << "\n";
}
