In how many ways can the letters in $BEEKEEPER$ be rearranged so that two or more $E$s do not appear together? Provide the number of such arrangements.

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