CF1375F.Integer Game

This is an interactive problem.

Anton and Harris are playing a game to decide which of them is the king of problemsetting.

There are three piles of stones, initially containing $a$, $b$, and $c$ stones, where $a$, $b$, and $c$ are distinct positive integers. On each turn of the game, the following sequence of events takes place:

• The first player chooses a positive integer $y$ and provides it to the second player.
• The second player adds $y$ stones to one of the piles, with the condition that he cannot choose the same pile in two consecutive turns.

The second player loses if, at any point, two of the piles contain the same number of stones. The first player loses if $1000$ turns have passed without the second player losing.

Feeling confident in his skills, Anton decided to let Harris choose whether he wants to go first or second. Help Harris defeat Anton and become the king of problemsetting!

这是一个交互式问题。

安东（Anton）和哈里斯（Harris）正在进行一场比赛，以决定谁将成为出题之王。

初始时有三堆石子，分别包含 $a$、$b$ 和 $c$ 颗石子，其中 $a$、$b$、$c$ 是互不相等的正整数。游戏每轮按如下顺序进行：

• 先手玩家选择一个正整数 $y$，并将该数告知后手玩家；
• 后手玩家将 $y$ 颗石子加入其中一堆石子中，但有一个限制：他不能在连续两轮中选择同一堆石子。

若在任意时刻有两堆石子数量相等，则后手玩家输；若在未出现上述情况的前提下已进行 $1000$ 轮，则先手玩家输。

安东对自己的实力充满信心，因此允许哈里斯自行选择执先手还是后手。请帮助哈里斯击败安东，成为出题之王！

The first line of input contains three distinct positive integers $a$, $b$, and $c$ ($1 \le a, b, c \le 10^9$) — the initial number of stones in piles $1$, $2$, and $3$ respectively.

输入的第一行包含三个互不相同的正整数 $a$、$b$ 和 $c$（$1 \le a, b, c \le 10^9$），分别表示第 $1$、$2$、$3$ 堆石子的初始数量。

In the sample input, the piles initially have $5$, $2$, and $6$ stones. Harris decides to go first and provides the number $2$ to Anton. Anton adds $2$ stones to the third pile, which results in $5$, $2$, and $8$.

In the next turn, Harris chooses $3$. Note that Anton cannot add the stones to the third pile since he chose the third pile in the previous turn. Anton realizes that he has no valid moves left and reluctantly recognizes Harris as the king.

在样例输入中，三堆石子的初始数量分别为 $5$、$2$ 和 $6$。哈里斯决定先手，并向安东提供数字 $2$。安东将 $2$ 颗石子加入第三堆，使得三堆石子数量变为 $5$、$2$ 和 $8$。

在下一轮中，哈里斯选择数字 $3$。注意：安东不能将石子加入第三堆，因为他上一轮已选择了第三堆。安东意识到自己已无合法操作可执行，只得不情愿地承认哈里斯为国王。