Ooooh Sexy... Part 2

When solving a Rubik's Cube, a common algorithm in speedcubing is the "sexy move," in which the solver performs the moveset $R D R' D'$ .

By mistake, Trevor got the algorithm wrong & performs the move $R D R' D$ .

How many times will he have to perform this move starting in a solved state, before he returns to the solved state again?

$\bullet$ If you think that he won't be able to complete the cube, then answer as $0$

Please see my sets: My Problems and My Favorites

Also try Inspired by Rubik's cube

This problem is inspired by Ooooh sexy by Trevor B. .

Learn more about move notations here