Spokes Wheel

A 32-spoke wheel has each spoke tagged 0 or 1. Given hex states before and after rotation, find the minimum number of left or right rotations that transforms the first state into the second.

Test count $T$, then each line has two 32-bit hex values $N_1$ and $N_2$.

Print Case #X: Y Left, Y Right, Y Any, or Not possible.