Powers of Three Walk

Donghyeok stands at the origin $(0, 0)$ of a plane of infinite size.

He moves in numbered stages and wants to arrive at the point $(x, y)$. Stage numbers start at $0$ and grow by $1$.

At stage $k$ he picks one of four directions, right ($x$ increases), left ($x$ decreases), up ($y$ increases), or down ($y$ decreases), and then moves exactly $3^k$ in that direction. He cannot skip a stage.

He performs as many stages as he wants and then stops. Stopping at the origin without performing a single stage is allowed.

Given $x$ and $y$, write a program that decides whether $(x, y)$ can be reached from $(0, 0)$.

The first line contains two integers $x$ and $y$ separated by a space. ($-10^9 \le x, y \le 10^9$)

Print $1$ if $(x, y)$ can be reached from $(0, 0)$, and $0$ otherwise.

If $x$ and $y$ are both $0$, he is already there before any stage, so print $1$.