#include <bits/stdc++.h>
using namespace std;
long long int powmod(long long int a, long long int b, long long int mod) {
  long long int res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
int nxt() {
  int x;
  cin >> x;
  return x;
}
vector<int> parent;
vector<vector<int> > adjList;
vector<pair<int, int> > leaves;
void dfs(int i, int d, int p) {
  for (int j = 0; j < (int)adjList[i].size(); j += 1)
    if (adjList[i][j] != p) {
      dfs(adjList[i][j], d + 1, i);
    }
  if (adjList[i].size() == 1) leaves.push_back(make_pair(d, adjList[i][0]));
}
int main() {
  int n = nxt();
  adjList.assign(n, vector<int>());
  for (int i = 0; i < n - 1; i += 1) {
    int a = nxt(), b = nxt();
    adjList[a - 1].push_back(b - 1);
    adjList[b - 1].push_back(a - 1);
  }
  dfs(0, 0, -1);
  bool even = true;
  bool parity = leaves[0].first % 2;
  for (int i = 0; i < (int)leaves.size(); i += 1)
    if (leaves[i].first % 2 != parity) {
      even = false;
      break;
    }
  int small = 3, big = n - 1;
  if (even) small = 1;
  map<int, int> mah;
  for (int i = 0; i < (int)leaves.size(); i += 1) mah[leaves[i].second]++;
  for (auto it = mah.begin(); it != mah.end(); it++) {
    big -= it->second - 1;
  }
  printf("%d %d\n", small, big);
}
