A frog is presently located at the origin $(0, 0)$ in the xy-plane. It always jumps from a point with integer coordinates to a point with integer coordinates moving a distance of $5$ units in each jump. What is the minimum number of jumps required for the frog to go from $(0, 0)$ to $(0, 1)$?

একটি সামান্তরিকের চারটি কৌণিক বিন্দু হল, A(4,4), B(-2, 7), $C(\alpha, \beta)$ এবং $D(6,-8)$

$\boldsymbol{A} A(-2,4), B(4,-5), F=\left[\begin{array}{ccc}1+p-q & 2 \sqrt{p q} & -2 \sqrt{q} \\ 2 \sqrt{p q} & 1-p+q & 2 \sqrt{q} \\ 2 \sqrt{q} & -2 \sqrt{p} & 1-p-q\end{array}\right]$