The number of valid ways to arrange $n$ pairs of parentheses is given by the Catalan number recurrence: $C_n = \sum_{i=0}^{n-1} C_i C_{n-1-i}$ with $C_0 = 1$. What is $C_3$?