#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
constexpr ll mod = 1000000007;
constexpr ll INF = 1000000099;
constexpr ll LINF = (ll)(1e18 + 99);
const vector<ll> dx = {-1, 1, 0, 0}, dy = {0, 0, -1, 1};
template <typename T, typename U>
inline bool chmin(T& t, const U& u) {
  if (t > u) {
    t = u;
    return 1;
  }
  return 0;
}
template <typename T, typename U>
inline bool chmax(T& t, const U& u) {
  if (t < u) {
    t = u;
    return 1;
  }
  return 0;
}
template <typename T>
inline T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T, typename Y>
inline T mpow(T a, Y n) {
  T res = 1;
  for (; n; n >>= 1) {
    if (n & 1) res = res * a;
    a = a * a;
  }
  return res;
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  ll n, lcnt = 0;
  cin >> n;
  VV<int> e(n, V<int>(0));
  set<int> lgr;
  bool ev = false, od = false;
  for (ll i = 0; i < (ll)(n - 1); ++i) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    e[a].emplace_back(b);
    e[b].emplace_back(a);
  }
  queue<int> q;
  q.push(0);
  q.push(-1);
  q.push(0);
  if ((ll)(e[0]).size() == 1) {
    lgr.insert(e[0][0]);
    ev = true;
    ++lcnt;
  }
  int now, dis, par;
  while (q.size()) {
    now = q.front();
    q.pop();
    par = q.front();
    q.pop();
    dis = q.front();
    q.pop();
    if (now && (ll)(e[now]).size() == 1) {
      lgr.insert(par);
      if (dis % 2)
        od = true;
      else
        ev = true;
      ++lcnt;
      cerr << now << '\n';
    } else {
      for (ll i = 0; i < (ll)((ll)(e[now]).size()); ++i) {
        if (e[now][i] == par) continue;
        q.push(e[now][i]);
        q.push(now);
        q.push(dis + 1);
      }
    }
  }
  if (!od || !ev)
    cout << 1 << " ";
  else
    cout << 3 << " ";
  cout << n - 1 - lcnt + (ll)(lgr).size() << '\n';
}
