Counting Strategies: Casework, Complementary & Overcounting · Hard problem

How many ways can the six digits $1,1,1,2,3,4$ be arranged in a row so that the three $1$'s are not all adjacent to each other?