// Recursion test, since the maximum unsigned integer is 65535, therefore, 
// the biggest factorial this system can handle is the result of number 8.

main()
{
   int   i;

   loop {
      writei('u', fact(i), 1000);
      i++;
      if(i == 9) i = 0;                  // loop again
   }
}

fact(n)
{
   if(n == 0)
      return(1);
   else
      return(n * fact(n-1));
}