Integrals I: Feynman's Trick · Superchallenge problem

A frog starts at the origin of the coordinate plane and makes a sequence of hops. Each hop has length $25$, and after each hop the frog is at a point whose coordinates are both integers (so there are $20$ possible landing points after the first hop). What is the smallest number of hops needed to reach the point $(1000, 1000)$?