Empty Two Coin Piles

Each move removes two coins from one pile and one coin from the other. Either orientation is allowed. You may never remove more coins than remain. Determine whether both piles can end at zero.

Implement coin_piles(left, right).

Input

left: The number of coins in the left pile.

right: The number of coins in the right pile.

Output

Return true if the piles can both be emptied; otherwise return false.

Constraints

0 ≤ left, right ≤ 1,000,000,000. Two empty piles are already a successful result.

Examples

Input:
left = 4
right = 2

Expected output:
expected = True

Input:
long long left = 4;
long long right = 2;

Expected output:
bool expected = true;

Input:
long left = 4;
long right = 2;

Expected output:
bool expected = true;

Input:
left = 4
right = 1

Expected output:
expected = False

Input:
long long left = 4;
long long right = 1;

Expected output:
bool expected = false;

Input:
long left = 4;
long right = 1;

Expected output:
bool expected = false;

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

• Coin Piles — 1754