You are standing at point $(1, 1)$ on an infinite two dimensional grid. From any point $(x, y)$, you can move to one of the following coordinates:

• $(x, y - x)$

• $(x - y, y)$

• $(2 \cdot x, y)$

• $(x, 2 \cdot y)$

Given two integers targetX and targetY, return true if you can reach the point (targetX, targetY) starting from $(1, 1)$, or false otherwise.

Constraints:

• $1 \leq$ targetX, targetY $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.