Call count of memoized Fibonacci

You compute $\text{fib}(10)$ with top-down recursion plus a memo cache, counting every invocation of the fib function - including calls that return immediately from the cache and the base cases $\text{fib}(0)$, $\text{fib}(1)$. The initial call fib(10) counts as one. How many total calls occur? (Convention: $\text{fib}(0)=0$, $\text{fib}(1)=1$.)