#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
long long int lcm(long long int a, long long int b) {
  return a * b / gcd(a, b);
}
const int N = 1e5 + 10;
int n, d[N], deg[N], f[N];
bool fl;
vector<int> ad[N];
set<int> s;
void dfs(int v, int par) {
  for (auto u : ad[v]) {
    if (u == par) continue;
    d[u] = d[v] + 1;
    dfs(u, v);
  }
}
void Dfs(int v, int par) {
  if (ad[v].size() == 1) f[par]++, s.insert(par);
  for (auto u : ad[v]) {
    if (u == par) continue;
    Dfs(u, v);
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    ad[x].push_back(y);
    ad[y].push_back(x);
    deg[x]++;
    deg[y]++;
  }
  int a = 0, mx = 0;
  dfs(1, 0);
  for (int i = 1; i <= n; i++) {
    if (d[i] > mx) {
      mx = d[i];
      a = i;
    }
  }
  for (int i = 1; i <= n; i++) d[i] = 0;
  dfs(a, 0);
  for (int i = 1; i <= n; i++) {
    if (deg[i] > 1) {
      Dfs(i, 0);
      break;
    }
  }
  int di = *max_element(d, d + 1 + n);
  for (int i = 1; i <= n; i++)
    if ((d[i] & 1) && ad[i].size() == 1) fl = 1;
  if (fl || (di & 1))
    printf("%d ", 3);
  else
    printf("%d ", 1);
  int ans = 0, tot = 0;
  for (int i = 1; i <= n; i++) ans += (f[i] > 0), tot += f[i];
  ans += (n - 1) - tot;
  printf("%d\n", ans);
  return 0;
}
