// A recursive implementation of the fibonacci sequence

fun fib(n) {
  if (n <= 1) return n;
  return fib(n - 2) + fib(n - 1);
}


print(fib(15));  //TODO: Benchmark this