Hugsy and his Jumping Game

When Joey is sound asleep, his bedtime pal Hugsy comes to life and starts playing the Jumping Game. Hugsy has a track containing $N + 1$ cells, numbered $0$ to $N$. Further, there is a value $A_i$ written on the $i$-th cell of the track. Hugsy starts from cell $0$ and wants to reach cell $N$. Hugsy can jump from cell $i$ to cell $(i + k)$ for any positive integer $k$ as long as $(i + k) \le N$.