Add to get GCD

You have $2$ integers $X$ and $Y$. You goal is to make them have a common divisor which is not $1$, i.e. there should exist $Z > 1$ such that $Z$ divides $X$ and $Z$ divides $Y$. In one operation, you can do either of the following: - Set $X$ to $X + 1$. - Set $Y$ to $Y + 1$. Find the minimum number of operations needed to achieve your goal. ### Input - The first line of input will contain