A staircase has steps where the number of bricks $B_n$ for step $n$ is defined by $B_n = B_{n-1} + 2$. If the first step ($B_1$) requires 3 bricks, how many bricks are needed for the third step ($B_3$)?