Several zeros, ones and twos are written on the blackboard. An anonymous clean in turn pairs of different numbers, writing, instead of cleaned, the number not equal to each. (0 instead of pair {1,2},1 instead of {0,2},2 instead of {0,1}). Prove that if there remains one number only, it does not depend on the processing order. game strategycombinatorics