#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
typedef struct a {
  int to, next;
} per;
per si[maxn * 4];
int ctt, n, chu[maxn], head[maxn], ji, ou, dep[maxn], vis[maxn], siz[maxn], cnt;
void add(int u, int v) {
  si[++ctt].next = head[u];
  si[ctt].to = v;
  head[u] = ctt;
}
int dfs(int now, int fa) {
  dep[now] = dep[fa] + 1;
  int sum = 0;
  for (int i = head[now]; i != -1; i = si[i].next) {
    int to = si[i].to;
    if (to != fa) {
      sum += dfs(to, now);
    }
  }
  if (sum > 1) cnt += sum - 1;
  if (si[head[now]].to == fa && si[head[now]].next == -1) {
    if (dep[now] & 1)
      ji = 1;
    else
      ou = 1;
    return 1;
  }
  return 0;
}
int main() {
  cin >> n;
  int u, v;
  memset(head, -1, sizeof(head));
  for (int i = 1; i < n; ++i) {
    cin >> u >> v;
    add(u, v);
    add(v, u);
    chu[u]++;
    chu[v]++;
  }
  int root;
  for (int i = 1; i <= n; ++i)
    if (chu[i] > 1) root = i;
  dfs(root, 0);
  if ((!ji) || (!ou))
    cout << 1 << ' ';
  else
    cout << 3 << ' ';
  cout << n - 1 - cnt;
  return 0;
}
