Question 17
Each card of a stack of $101$ cards has one side colored red and the other colored blue. Initially all cards have the red side facing up and stacked together in a deck. On each turn, Ah Meng takes $8$ cards on the top, flip them over, and place them to the bottom deck. Determine the minimum number of turns required so that all the cards have the red sides facing up again.