#include <bits/stdc++.h>
using namespace std;
char buf[1 << 21], *p1 = buf, *p2 = buf, obuf[1 << 23], *O = obuf;
inline int read() {
  int x = 0, sign = 0;
  char s = getchar();
  while (!isdigit(s)) sign |= s == '-', s = getchar();
  while (isdigit(s)) x = (x << 1) + (x << 3) + (s - '0'), s = getchar();
  return sign ? -x : x;
}
void print(int x) {
  if (x > 9) print(x / 10);
  (*O++ = x % 10 + '0');
}
const int N = 3e5 + 5;
int n, l[N], fa[N], ma;
vector<int> e[N], d1[N], d2[N], dep[2];
void dfs(int id, int f, int d) {
  fa[id] = f;
  if (l[id])
    d1[fa[id]].push_back(id), d2[fa[fa[id]]].push_back(id),
        dep[d & 1].push_back(id);
  for (auto it : e[id])
    if (it != f) dfs(it, id, d + 1);
  if (d1[id].size()) ma -= d1[id].size() - 1;
}
void solve() {
  cin >> n;
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    e[u].push_back(v), e[v].push_back(u);
  }
  for (int i = 1; i <= n; i++)
    if (e[i].size() == 1) l[i] = 1;
  for (int i = 1; i <= n; i++)
    if (e[i].size() > 1) {
      ma = n - 1, dfs(i, 0, 0);
      cout << (dep[0].size() && dep[1].size() ? 3 : 1) << " " << ma << endl;
      return;
    }
}
int main() {
  int testcase = 1;
  while (testcase--) solve();
  return 0;
}
