RU-ALLRUSSIAN 2021 Problem 98

One hundred sages play the following game. They are waiting in some fixed order in front of a room. The sages enter the room one after another. When a sage enters the room, the following happens - the guard in the room chooses two arbitrary distinct numbers from the set { $1,2,3$ }, and announces them to the sage in the room. Then the sage chooses one of those numbers, tells it to the guard, and leaves the room, and the next enters, and so on. During the game, before a sage chooses a number, he can ask the guard what were the chosen numbers of the previous two sages. During the game, the sages cannot talk to each other. At the end, when everyone has finished, the game is considered as a failure if the sum of the 100 chosen numbers is exactly $200$ ; else it is successful. Prove that the sages can create a strategy, by which they can win the game.