#include <bits/stdc++.h>
using namespace std;
const int Inf = 2e9;
const int MaxN = 1e5 + 5;
int n;
int Max;
int Min;
vector<int> G[MaxN];
void DFS_Max(int x, int p = -1) {
  for (auto v : G[x]) {
    if (v == p) continue;
    DFS_Max(v, x);
  }
  int cnt = 0;
  for (auto v : G[x]) {
    if (v == p) continue;
    if (G[v].size() == 1) cnt++;
  }
  if (cnt > 1) Max -= cnt - 1;
}
vector<int> O;
vector<int> E;
void DFS_Min(int x, int p = -1) {
  if (G[x].size() == 1) {
    E[x] = 1;
    return;
  }
  for (auto v : G[x]) {
    if (v == p) continue;
    DFS_Min(v, x);
  }
  int o = 0;
  int e = 0;
  for (auto v : G[x]) {
    if (v == p) continue;
    if (E[v]) o++;
    if (O[v]) e++;
    E[x] += O[v];
    O[x] += E[v];
  }
  if (e == 0 || o == 0) return;
  Min = 3;
  return;
  for (auto v : G[x]) {
    if (v == p) continue;
    if (O[v]) {
      Min += o - (E[v] > 0);
    }
  }
}
int Go() {
  scanf("%d", &n);
  for (int i = 0; i < n - 1; ++i) {
    int x, y;
    scanf("%d %d", &x, &y);
    G[x].push_back(y);
    G[y].push_back(x);
  }
  int root = 1;
  Max = n - 1;
  Min = 1;
  for (int i = 1; i <= n; ++i)
    if (G[i].size() > 1) root = i;
  DFS_Max(root);
  O.resize(n + 1, 0);
  E.resize(n + 1, 0);
  DFS_Min(root);
  cout << Min << " " << Max << endl;
  return 0;
}
int main() {
  int t;
  if (0)
    scanf("%d", &t);
  else
    t = 1;
  while (t--) Go();
}
