#include <bits/stdc++.h>
using namespace std;
void dfs(int vertex, map<int, vector<int> >& mp1, vector<int>& dist) {
  for (int j = 1; j < mp1[vertex].size(); j++) {
    if (dist[mp1[vertex][j]] == -1) {
      dist[mp1[vertex][j]] = dist[vertex] + 1;
      dfs(mp1[vertex][j], mp1, dist);
    }
  }
}
int main() {
  int n;
  cin >> n;
  int x, y;
  map<int, vector<int> > mp1;
  set<int> inter, exter;
  for (int i = 1; i <= n; i++) mp1[i].push_back(-1);
  for (int i = 0; i < n - 1; i++) {
    cin >> x >> y;
    mp1[x].push_back(y);
    mp1[y].push_back(x);
  }
  for (int i = 1; i <= n; i++) {
    if (mp1[i].size() > 2) {
      inter.insert(i);
    } else
      exter.insert(i);
  }
  int ind;
  set<int>::iterator itr;
  int inter_hav_ext = 0;
  for (itr = inter.begin(); itr != inter.end(); itr++) {
    int f = *itr;
    for (int j = 1; j < mp1[f].size(); j++)
      if (exter.find(mp1[f][j]) != exter.end()) {
        ind = f;
        inter_hav_ext++;
        mp1[f][0] = 0;
        break;
      }
  }
  long long max = 0, min = 1;
  vector<int> dist(n + 1, -1);
  dist[ind] = 0;
  dfs(ind, mp1, dist);
  for (int i = 1; i <= n; i++) {
    if (dist[i] % 2 == 1 && mp1[i][0] == 0) {
      min = 3;
      break;
    }
  }
  max = (n - 1 - exter.size()) + inter_hav_ext;
  cout << min << " " << max << endl;
}
