// Soln5_1.cpp
#include <iostream>
using std::cout;
using std::endl;

// Recursive factorial function
long fact(long n)
{
  return n == 1L ? 1L : n*fact(n-1);
}

int main()
{
  for(long value = 2 ; value<10L ; value++)
    cout << value << "! = " << fact(value) << endl;

  return 0;
}