There are 54 cards in a deck, the top one is K of Hearts. If the top 12 cards are moved to the bottom each time without changing their order and orientation, then at least how many moves will the Heart K appear on the top again.
一副扑克牌共54张，最上面的一张是红桃K．如果每次把最上面的12张牌移到最下面而不改变它们的顺序及朝向，那么，至少经过多少次移动，红桃K才会又出现在最上面．
<gadget id="calculator">2 * 2 * 3 * 3 * 3</gadget>
<output>108</output>

<gadget id="calculator">108 / 12</gadget>
<output>9</output>

<result>9</result>