// Compute n! via straight recursion.

int Factorial(int n) {
  if (n == 0) { return 1; };
  return n * Factorial(n - 1);
}