Mack the bug is currently at the point 0 on the real number line. On a turn, Mack can move either $126$ units to the right, or 98 units to the left. So for example, Mack can move 98 units to the left, another 98 units to the left, then 126 units to the right, and end up at the point (-98) + (-98) + 126 = -70.
Mack wants to land at a point with a positive number n that is as close to 0 as possible. What is the smallest possible value of n?