The recursive definition of the number of binary trees with $n$ nodes is given by $C_n = \sum_{i=0}^{n-1} C_i C_{n-1-i}$. What is $C_3$ (where $C_0=1$)?