A guest is said to be lucky if at least two of his/her friends in the party wear differently colored hats.
Determine all possible values of n for which it is always possible to choose a guest and to change his/her hat to hat of one
of the remaining two colors such that the total number of lucky guests will not be decreased.
Note: For any pair of partygoers, they are either mutual friends or mutual strangers.
