#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7, N = 205001;
long long mm(long long x, long long y) {
  x %= M, y %= M;
  return (x * y) % M;
}
long long po(long long x, long long y) {
  if (!y) return 1;
  long long a = po(x, y / 2) % M;
  if (y % 2) return mm(a, mm(a, x));
  return mm(a, a);
}
vector<long long> g[N];
bool chk = false;
long long st;
void dfs(long long s, long long p, long long h) {
  long long cnt = 0;
  for (long long i : g[s]) {
    if (i != p) dfs(i, s, h + 1);
    if (g[i].size() == 1) cnt++;
  }
  if (cnt) st++;
  if (g[s].size() == 1 and h % 2) chk = true;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, x, y, l, lc = 0;
  cin >> n;
  for (long long i = 1; 1 < n ? i < n : i > n; 1 < n ? i += 1 : i -= 1) {
    cin >> x >> y;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  for (long long i = 1; 1 < n + 1 ? i < n + 1 : i > n + 1;
       1 < n + 1 ? i += 1 : i -= 1)
    if (g[i].size() == 1) {
      l = i;
      lc++;
    }
  dfs(l, 0, 0);
  x = (chk ? 3 : 1);
  y = n - 1 - lc + st;
  cout << x << " " << y;
}
