Charlie has a magic mirror. The mirror shows right rotated versions of a given word.

To generate different right$-$rotations of a word, write the word in a circle in clockwise order, then start reading from any given character in clockwise order till you have covered all the characters.

For example: In the word "sample", if we start with $\text{'}p\text{'},$ we get the right rotated word as "plesam". There are six such right rotations of "sample" including itself.

The inputs to the function isSameReflection consists of two strings, word$1$ and word$2.$ The function returns $1$ if word $1$ and word $2$ are right rotations of the same word and $-1$ if they are not. Both word $1$ and word $2$ will strictly