#include //#include using namespace std; //using namespace atcoder; //using mint = modint998244353; //const int mod = 998244353; //using mint = modint1000000007; //const int mod = 1000000007; const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector> to(n); rep(i, n - 1) { int a, b; cin >> a >> b; a--, b--; to[a].push_back(b); to[b].push_back(a); } vector dp(n, vector(2));// 0最大,1最小 auto dfs = [&](auto self, int v, int p = -1)->void { if (-1 != p && 1 == to[v].size()) return; if (-1 == p && 0 == to[v].size()) return; int d0 = -INF; int d1 = INF; for (auto nv : to[v]) { if (p == nv)continue; self(self, nv, v); chmax(d0, dp[nv][1] + 1); chmin(d1, dp[nv][0] + 1); } dp[v][0] = d0; dp[v][1] = d1; }; dfs(dfs, 0); cout << dp[0][0] << endl; cout << dp[0][1] << endl; return 0; }