Description

There are two piles of stones, and each pile contains a random number of stones. The game is played by two people taking away stones in turn. The game defines two ways to take away stones. The first way is to take away an arbitrary number of stones from one file, and the other way is to take away the same number of stones from both piles. The person who does the last "take away" is the winner. Given the numbers of stones of the two piles, can you win the game if you do the first "take away" in the game? Assume that each player adopts the best strategy.

Input

Input contains several lines containg the initial state of the two piles of stones. Each line will be two non-negative integer a, b, representing the numbers of the two piles of stones. a, b <= 1,000,000,000。

Output

Output 1 if you win, 0 otherwise。
Sample Input

2 1
8 4
4 7
Sample Output

0
1
0
Source

NOI