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.

Restricciones

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

Ejemplos

Entrada:
left = 4
right = 2

Salida esperada:
expected = True

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

Salida esperada:
bool expected = true;

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

Salida esperada:
bool expected = true;

Entrada:
left = 4
right = 1

Salida esperada:
expected = False

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

Salida esperada:
bool expected = false;

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

Salida esperada:
bool expected = false;

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

• Coin Piles — 1754