#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const double Pi = acos(-1);
namespace {
template <typename T>
inline void read(T &x) {
  x = 0;
  T f = 1;
  char s = getchar();
  for (; !isdigit(s); s = getchar())
    if (s == '-') f = -1;
  for (; isdigit(s); s = getchar()) x = (x << 3) + (x << 1) + (s ^ 48);
  x *= f;
}
}  // namespace
const int N = 1e5 + 5;
struct node {
  int to, next;
} e[N << 1];
int head[N], cnt, du[N];
bool vis[N];
void add(int u, int v) {
  e[++cnt] = node{v, head[u]};
  head[u] = cnt;
  e[++cnt] = node{u, head[v]};
  head[v] = cnt;
}
int siz[N];
void dfs(int u, int fa) {
  for (int i = head[u]; i; i = e[i].next) {
    int v = e[i].to;
    if (v == fa) continue;
    du[v] = du[u] + 1;
    dfs(v, u);
  }
}
int main() {
  int n, u, v;
  read(n);
  for (register int i = (1); i < (n); ++i) {
    scanf("%d%d", &u, &v);
    add(u, v);
    du[u]++;
    du[v]++;
  }
  for (register int i = (1); i <= (n); ++i)
    if (du[i] == 1) vis[i] = 1, siz[e[head[i]].to]++;
  for (register int i = (1); i <= (n); ++i)
    if (du[i] != 1) {
      dfs(i, 0);
      break;
    }
  int f1 = 0, f2 = 0;
  for (register int i = (1); i <= (n); ++i) {
    if (!vis[i]) continue;
    if (du[i] & 1) f1 = 1;
    if (du[i] > 1 && du[i] % 2 == 0) f2 = 1;
  }
  int ans1 = 1, ans2 = n - 1;
  for (register int i = (1); i <= (n); ++i)
    if (siz[i]) ans2 -= siz[i] - 1;
  if (f1 && f2) ans1 = 3;
  cout << ans1 << " " << ans2 << endl;
}
