Problem Description

In a pond, there is a long row of lotus leaves, and each lotus leaf has its own unique number.

The little frog, Guagua, is a very energetic frog. Its jumping strength is fixed each time. If it is on lotus leaf $N$, with one jump it can land precisely on lotus leaf $N+1$, $N-1$, $N+2$, or $N-2$.

Today, Guagua is lying on lotus leaf 2026 sunbathing. Suddenly, it sees a delicious little bug on lotus leaf 1021. To catch the food as soon as possible, please calculate the minimum number of jumps Guagua needs to reach the lotus leaf where the bug is.

Output Format

This is a result-only fill-in-the-blank problem. You only need to compute the result and submit it. The result of this problem is an integer. When submitting the answer, only fill in this integer. If you include extra content, you will not get any points.

Hint

Translated by ChatGPT 5