#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
long long a[N];
vector<long long> node[N];
long long dp[N][20], dep[N], vis[N];
void dfs(long long u, long long par) {
  for (int i = 1; i < 20; i++) {
    dp[u][i] = dp[dp[u][i - 1]][i - 1];
  }
  for (auto j : node[u]) {
    if (j != par) {
      dep[j] = dep[u] + 1;
      dp[j][0] = u;
      dfs(j, u);
    }
  }
}
long long lca(long long x, long long y) {
  if (dep[x] > dep[y]) swap(x, y);
  long long d = dep[y] - dep[x];
  for (int i = 0; i < 20; i++) {
    if (d >> i & 1) {
      y = dp[y][i];
    }
  }
  if (x == y) return x;
  for (int i = 20 - 1; i >= 0; i--) {
    if (dp[x][i] != dp[y][i]) {
      x = dp[x][i];
      y = dp[y][i];
    }
  }
  return dp[x][0];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  for (int i = 1; i < n; i++) {
    long long x, y;
    cin >> x >> y;
    node[x].push_back(y);
    node[y].push_back(x);
  }
  vector<long long> one;
  for (int i = 1; i <= n; i++) {
    if (node[i].size() == 1) {
      one.push_back(i);
      vis[i] = 1;
    }
  }
  dfs(one[0], one[0]);
  long long ans = 1;
  for (int i = 1; i < one.size(); i++) {
    long long x = dep[one[0]] + dep[one[i]] - dep[lca(one[0], one[i])];
    if (x % 2 == 1) {
      ans = 3;
    }
  }
  long long ans2 = n - 1;
  for (int i = 1; i <= n; i++) {
    long long cnt = 0;
    for (auto j : node[i]) {
      if (vis[j] == 1) {
        cnt++;
      }
    }
    if (cnt >= 2) ans2 = ans2 - cnt + 1;
  }
  cout << ans << " " << ans2;
}
