#include <bits/stdc++.h>
using namespace std;
long long int binpowmod(long long int a, long long int b, long long int m) {
  a %= m;
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % m;
    a = a * a % m;
    b >>= 1;
  }
  return res;
}
long long int binpow(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
long long int modInverse(long long int n, long long int p) {
  return binpowmod(n, p - 2, p);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t, m, n, i, f = 0, j, ans = 0, u, v, s;
  cin >> n;
  vector<vector<long long int>> adj(n + 1);
  vector<long long int> used(n + 1, 0);
  for (i = 0; i < n - 1; ++i) {
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
    used[u]++;
    used[v]++;
  }
  for (i = 1; i < n + 1; ++i) {
    if (used[i] == 1) {
      s = i;
      break;
    }
  }
  vector<long long int> d(n + 1, -1), p(n + 1, -1);
  vector<long long int> lf;
  queue<long long int> q;
  q.push(s);
  d[s] = 0;
  lf.push_back(s);
  while (!q.empty()) {
    u = q.front();
    q.pop();
    t = 0;
    for (auto k : adj[u]) {
      if (d[k] == -1) {
        if (s == u) p[s] = k;
        t++;
        q.push(k);
        d[k] = d[u] + 1;
        p[k] = u;
      }
    }
    if (t == 0) lf.push_back(u);
  }
  long long int mmin, mmax = 0;
  long long int flag = 1;
  for (i = 0; i < lf.size(); ++i) {
    if (d[lf[i]] % 2 == 0)
      continue;
    else {
      flag = 0;
      break;
    }
  }
  if (flag == 1)
    mmin = 1;
  else
    mmin = 3;
  ans = n - 1;
  map<long long int, long long int> ma;
  for (i = 0; i < lf.size(); ++i) {
    ma[p[lf[i]]]++;
  }
  for (auto itr = ma.begin(); itr != ma.end(); ++itr) {
    long long int temp = itr->second;
    ans -= (temp - 1);
  }
  cout << mmin << " " << ans;
  return 0;
}
