Stone Groups

Kangho plays a game with stones. The stones sit in three groups holding $A$, $B$ and $C$ stones. Kangho wants all three groups to hold the same number of stones.

He moves stones one step at a time, and a step works like this.

1. Pick two groups whose stone counts differ.
2. Call the smaller count $X$ and the larger count $Y$.
3. Change the smaller group to $X+X$ stones and the larger group to $Y-X$ stones.

Write a program that prints 1 if repeating the step any number of times can make the three groups hold the same number of stones, and 0 otherwise.

The first line contains $A$, $B$ and $C$ separated by spaces. ($1 \le A, B, C \le 500$)

Print 1 if the three groups can be made to hold the same number of stones, and 0 otherwise.