There are n markers, each with one side white and the other side black, aligned in a row with their white sides up. at each step, if possible, we choose a marker with the white side up (but not one of the outermost markers), remove it, and reverse the two neighboring markers. prove that one can reach a configuration with only two markers left if and only if n − 1 is not divisible by 3.