In binary search on a sorted array of 1024 elements, the recurrence is $T(n) = T(n/2) + 1$ with $T(1) = 1$. How many total recursive calls (including the initial call) are made?