A <spanclass=′latex−italic′>shuffle</span> is a permutation of the integers 1,2,3,4,5. More formally, a shuffle is a function f:{1,2,3,4,5}→{1,2,3,4,5} such that if i=j then f(i)=f(j). For example, 12345↦23154 denotes a shuffle f so that f(1)=2, f(2)=3, f(3)=1, f(4)=5, and f(5)=4. A shuffle can be repeated some number of times to obtain another shuffle. For example, if f is the shuffle 12345↦23154 from above, then repeating f twice gives the shuffle g(x)=f(f(x)) which is 12345↦31245. How many shuffles are there that, when repeated 6 times, give the shuffle 12345↦12345?