#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<vector<int>> graph(n);
  REP(_, n - 1) {
    int a, b; cin >> a >> b; --a; --b;
    graph[a].emplace_back(b);
    graph[b].emplace_back(a);
  }
  const auto dp = [&](auto dp, const int par, const int ver, const bool is_halc) -> int {
    int dpv = (is_halc ? 0 : INF);
    for (const int e : graph[ver]) {
      if (e != par) {
        const int child = dp(dp, ver, e, !is_halc) + 1;
        if (is_halc) {
          chmax(dpv, child);
        } else {
          chmin(dpv, child);
        }
      }
    }
    return is_halc ? dpv : (dpv == INF ? 0 : dpv);
  };
  cout << dp(dp, -1, 0, true) << '\n'
       << dp(dp, -1, 0, false) << '\n';
  return 0;
}