Sticks

Bajtuś found 3 sticks in the forest. He now wants to know whether he can build a right triangle or an equilateral triangle out of them. Bajtuś cannot break the sticks; he may only use each stick whole.

The first line contains three integers $a$, $b$, $c$ ($1 \le a, b, c \le 1000$), the lengths of the first, second, and third stick respectively.

Print a single integer: $0$ if Bajtuś can build neither a right triangle nor an equilateral triangle, $1$ if he can build only a right triangle, and $2$ if he can build only an equilateral triangle.