Peter is randomly filling boxes with candy. If he has 10 pieces of candy and 5 boxes in a row labeled $A$, $B$, $C$, $D$, and $E$, how many ways can he distribute the candy so that no two adjacent boxes are empty?

Let's think step by step and output the final answer within \boxed{}.
user