import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }



int N;
int[] A, B;

int[][] graph;
int[] mxs, mns;

void dfs(int u, int p) {
  bool leaf = true;
  mxs[u] = int.min;
  mns[u] = int.max;
  foreach (v; graph[u]) if (p != v) {
    leaf = false;
    dfs(v, u);
    chmax(mxs[u], 1 + mns[v]);
    chmin(mns[u], 1 + mxs[v]);
  }
  if (leaf) {
    mxs[u] = mns[u] = 0;
  }
}

void main() {
  try {
    for (; ; ) {
      N = readInt;
      A = new int[N - 1];
      B = new int[N - 1];
      foreach (i; 0 .. N - 1) {
        A[i] = readInt - 1;
        B[i] = readInt - 1;
      }
      
      graph = new int[][N];
      foreach (i; 0 .. N - 1) {
        graph[A[i]] ~= B[i];
        graph[B[i]] ~= A[i];
      }
      mxs = new int[N];
      mns = new int[N];
      dfs(0, -1);
      writeln(mxs[0]);
      writeln(mns[0]);
    }
  } catch (EOFException e) {
  }
}