#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, h[maxn], t, ans, E[2];
vector<int> v[maxn];
void dfs(int i, int j) {
  h[i] = h[j] + 1;
  int push_back = 0;
  if (v[i].size() == 1) E[h[i] & 1]++;
  for (auto A : v[i]) {
    if (A - j) {
      if (v[A].size() > 1)
        ans++;
      else
        push_back = 1;
      dfs(A, i);
    }
  }
  if (push_back) ans++;
}
void solve() {
  cin >> n;
  h[0] = 1;
  for (int y = 1; y <= n; y++) {
    h[y] = 0;
    v[y].clear();
  }
  for (int y = 1; y < n; y++) {
    int i, j;
    cin >> i >> j;
    v[i].push_back(j);
    v[j].push_back(i);
  }
  int root = 0;
  for (int y = 1; y <= n; y++)
    if (v[y].size() > 1) root = y;
  ans = E[1] = E[2] = 0;
  dfs(root, 0);
  if (E[0] == 0 || E[1] == 0)
    cout << 1;
  else
    cout << 3;
  cout << ' ' << ans << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  t = 1;
  while (t--) {
    solve();
  }
}
