#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10, M = 2e5 + 10;
int n;
int h[N], e[M], ne[M], idx;
vector<int> ru[N];
vector<int> chu[N];
map<int, int> ans;
int dist[N];
bool st[N];
int q[N];
void add(int a, int b) {
  e[idx] = b;
  ne[idx] = h[a];
  h[a] = idx++;
}
void spfa(int s) {
  memset(dist, 0x3f, sizeof dist);
  int hh = 0, tt = 1;
  dist[s] = 0;
  q[0] = s;
  while (hh != tt) {
    int t = q[hh++];
    if (hh == N) hh = 0;
    st[t] = false;
    for (int i = h[t]; ~i; i = ne[i]) {
      int j = e[i];
      if (dist[j] > dist[t] + 1) {
        dist[j] = dist[t] + 1;
        if (!st[j]) {
          st[j] = true;
          q[tt++] = j;
          if (tt == N) tt = 0;
        }
      }
    }
  }
}
int main() {
  cin >> n;
  memset(h, -1, sizeof h);
  for (int i = 1; i < n; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    ru[a].push_back(b);
    chu[a].push_back(b);
    ru[b].push_back(a);
    chu[b].push_back(a);
    add(a, b);
    add(b, a);
  }
  int m = n - 1;
  int s = 0;
  for (int i = 1; i <= n; i++) {
    if (ru[i].size() == 1 && chu[i].size() == 1) {
      ans[chu[i][0]]++;
      if (!s) s = chu[i][0];
    }
  }
  spfa(s);
  bool ok = true;
  for (auto item : ans) {
    m -= (item.second - 1);
    if (dist[item.first] % 2) ok = false;
  }
  if (ok)
    cout << 1 << ' ' << m << '\n';
  else
    cout << 3 << ' ' << m << '\n';
  return 0;
}
