Induction · Medium problem

In the L-tromino induction, a $2^n \times 2^n$ board with one square removed is tiled completely. How many L-trominoes are used when $n = 5$?