Calculates the n-th term of the Fibonacci sequence.

This recursive implementation is suboptimal on purpose. The goal is to have a function with extensive redundant branching.

Calculates factorial of n with a delay of 1 ms after each step