#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;
const int dx[] = {-1, 0, 1, 0, -1, 1, 1, -1};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
vector<int> adj[100000];
int id[100000];
int mn, mx;
void dfs(int now, int prv = -1) {
  int ch = 0;
  for (int nxt : adj[now])
    if (nxt != prv) {
      ++ch;
      dfs(nxt, now);
    }
  if (ch == 0 || prv == -1 && ch == 1) id[now] = 0;
}
void dfs2(int now, int prv = -1) {
  bool near = 0;
  for (int nxt : adj[now])
    if (id[nxt] == 0) near = 1;
  if (id[now] == -1) {
    if (near)
      id[now] = 1, ++mx;
    else
      id[now] = 2;
  }
  for (int nxt : adj[now])
    if (nxt != prv) {
      dfs2(nxt, now);
      if (id[now] && id[nxt]) ++mx;
    }
}
void dfs3(int now, int dist, int prv = -1) {
  if (id[now] == 0) {
    if (dist & 1) mn = 3;
  }
  for (int nxt : adj[now])
    if (nxt != prv) {
      dfs3(nxt, dist + 1, now);
    }
}
int main() {
  cin.sync_with_stdio(false);
  cin.tie(nullptr);
  memset(id, -1, sizeof(id));
  int N;
  cin >> N;
  for (int a, b, i = 1; i < N; ++i) {
    cin >> a >> b;
    adj[--a].push_back(--b);
    adj[b].push_back(a);
  }
  dfs(0);
  dfs2(0);
  mn = 1;
  for (int i = 0; i < N; ++i)
    if (id[i] == 0) {
      dfs3(i, 0);
      break;
    }
  cout << mn << ' ' << mx;
  return 0;
}
