#include <bits/stdc++.h>
using namespace std;
const int dx[8] = {-1, 0, 0, 1, 1, 1, -1, -1};
const int dy[8] = {0, -1, 1, 0, -1, 1, -1, 1};
int gcd(int a, int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
const int N = 1e5 + 5;
vector<int> adj[N + 1];
int maxf = 0, minf = 1;
int visit[N + 1], parent[N + 1], parentofleaf[N + 1];
void dfs(int v, int count) {
  visit[v] = 1;
  if (parentofleaf[v] == 1) {
    if (count % 2 == 1) minf = 3;
  }
  int no = 0;
  for (auto u : adj[v]) {
    if (adj[u].size() == 1) no++;
    if (visit[u] == -1 && adj[u].size() > 1) {
      dfs(u, count + 1);
    }
  }
  if (no > 0) maxf -= (no - 1);
}
void initiall(int n) {
  for (int i = 0; i <= n; i++) {
    adj[i].clear();
    visit[i] = -1;
    parent[i] = 0;
    parentofleaf[i] = 0;
  }
}
void solve() {
  int n, i;
  cin >> n;
  int a, b;
  initiall(n);
  for (i = 1; i < n; i++) {
    cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
    parent[a] = b;
    parent[b] = a;
  }
  for (i = 1; i <= n; i++) {
    if (adj[i].size() == 1) {
      parentofleaf[parent[i]] = 1;
    }
  }
  maxf = n - 1;
  for (i = 1; i <= n; i++) {
    if (visit[i] == -1 && parentofleaf[i] == 1) dfs(i, 0);
  }
  cout << minf << " " << maxf << endl;
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tc = 1;
  for (int j = 1; j <= tc; j++) {
    solve();
  }
  return 0;
}
