Tower of Hanoi $-$ cyclic

The Tower of Hanoi consists of three rods $($A$,$ B$,$ C$)$and a number of disks of different sizes, which can slide onto any rod.

The puzzle starts with the disks in a neat stack in ascending order of size on one rod A$,$ the smallest at the top, thus making a conical shape.

The objective of the puzzle is to move the entire stack from rod A to rod C$,$ obeying the following simple rules:

$1.$ Only one disk can be moved at a time.

$2.$ Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.

$3.$ No larger disk may be placed on top of a smaller disk.

In the cyclic Hanoi puzzel there are the added restrictions:

$4.$ A can only move to B

$5.$ B can only move to C

$6.$ C can only move to A

Implement the cyclic Hanoi. The input should be the number of disks in the original stack. The output should be a series of lines in the format:

MOVE X TO X

For example:

Move A TO B

Move B TO C

Move A TO B

Move C TO A

$...$ etc.

In C