#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.141592653589793238462643383279;
const long long MOD = 1e15;
const long long INF = 1e9;
const long double eps = 0.000000000000001;
template <class T>
inline istream& operator>>(istream& str, vector<T>& a) {
  for (auto& i : a) str >> i;
  return str;
}
void boot_up() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout.setf(ios::fixed);
  cout.precision(15);
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
vector<vector<long long>> field(1e5 + 1);
vector<long long> st, st2;
vector<long long> used(1e5 + 1);
void dfs1(long long v, long long ptr) {
  if (field[v].size() == 1) {
    st.push_back(ptr);
  }
  used[v] = 1;
  for (auto i : field[v]) {
    if (!used[i]) {
      dfs1(i, ptr + 1);
    }
  }
}
void dfs2(long long v) {
  if (field[v].size() == 1) {
    st2.push_back(field[v][0]);
  }
  used[v] = 1;
  for (auto i : field[v]) {
    if (!used[i]) {
      dfs2(i);
    }
  }
}
signed main() {
  boot_up();
  long long t;
  long long n;
  cin >> n;
  for (long long i = 0; i < n - 1; i++) {
    long long u, v;
    cin >> u >> v;
    field[u].push_back(v);
    field[v].push_back(u);
  }
  long long ptr;
  for (long long i = 0; i <= 100000; i++) {
    if (field[i].size() == 1) {
      dfs1(i, 1);
      ptr = i;
      break;
    }
  }
  long long f_min = 1, f_max = n - 1;
  for (auto i : st) {
    if (i % 2 != st[0] % 2) {
      f_min = 3;
    }
  }
  cout << f_min << endl;
  for (long long i = 0; i <= n; i++) used[i] = 0;
  dfs2(ptr);
  set<long long> s;
  for (auto i : st2) {
    s.insert(i);
  }
  f_max -= (st2.size() - s.size());
  cout << f_max << endl;
  return 0;
}
