We investigate a coin-weighing puzzle that appeared in the all-Russian Mathematics Olympiad in 2000. The methods of analysis differ from classical coin-weighing puzzles. We generalize the puzzle by varying the number of participating coins, and deduce a complete solution. Perhaps surprisingly, the objective can be achieved in no more than two weighings regardless of the number of coins involved.
