A recursive algorithm is designed to calculate the sum of the first $n$ positive odd numbers. If the recursive step is $S(n) = S(n-1) + (2n-1)$, what is the base case required for this algorithm?