#include <bits/stdc++.h>
using namespace std;

int main() 
{
  int n;cin>>n;
  vector<vector<int>> v(n+1);
  for(int i = 0;i<n-1;i++){
    int a,b;cin>>a>>b;
    v[a].push_back(b);
    v[b].push_back(a);
  }
  vector<int> fok(n+1,-1);
  int ans1=0, ans2=0;
  queue<int> q;
  int k=1;
  while(v[k].size()!=1)k++;
  q.push(k);
  fok[k]=0;
  while(!q.empty()){
    int node=q.front();
    q.pop();
    if(node!=k&&v[node].size()>2)ans1+=(int)v[node].size()-2;
    for(int i : v[node]){
      if(fok[i]==-1){
        q.push(i);
        fok[i]=v[i].size();
      }
    }
  }
  int temp=1;
  for(int i = 1;i<=n;i++){
    if(fok[temp]<fok[i])temp=i;
  }
  fill(fok.begin(),fok.end(),-1);
  q.push(temp);
  fok[temp]=0;
  while(!q.empty()){
    int node=q.front();
    q.pop();
    bool corr=false;
    for(int i : v[node]){
      if(i==temp)corr=true;
      if(fok[i]==-1){
        q.push(i);
        fok[i]=v[i].size();
      }
    }
    if(!corr&&node!=temp)ans2++;
  }
  cout<<ans1<<' '<<ans2<<endl;
}