#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int N = (int)5e5 + 100;
const int M = (int)2e6 + 100;
const int inf = (int)1e9 + 100;
vector<int> v[N];
pair<bool, bool> dfs(int x, int pr = -1) {
  pair<bool, bool> o = {0, 0};
  if (v[x].size() == 1) o.first = 1;
  for (auto y : v[x]) {
    if (y == pr) continue;
    pair<bool, bool> c = dfs(y, x);
    o.first = max(o.first, c.second);
    o.second = max(o.second, c.first);
  }
  return o;
}
int main() {
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  srand(time(0));
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, i, a, b;
  cin >> n;
  for ((i) = 0; (i) < (n - 1); (i)++) {
    cin >> a >> b;
    a--;
    b--;
    v[a].push_back(b);
    v[b].push_back(a);
  }
  vector<int> g;
  for ((i) = 0; (i) < (n); (i)++) {
    if (v[i].size() == 1) {
      g.push_back(v[i][0]);
    }
  }
  a = g.size();
  sort((g).begin(), (g).end()),
      g.resize(unique((g).begin(), (g).end()) - g.begin());
  b = g.size();
  pair<bool, bool> cc = dfs(0);
  if (cc.first && cc.second) {
    cout << 3;
  } else {
    cout << 1;
  }
  cout << ' ' << n - 1 - (a - b);
}
