A mathematician, Pi, is walking on the number line on which each unit is divided into 17 equal intervals.
Pi's jump can either be 1 or 1:
0 1
1
S
17
10
17
15
17
If Pi is at a position where p is an integer, how many jumps at most does he need to reach an integer
nearest to ?
