Given a representation of a staircase with 'N' steps (0 to n-1), each step is labeled with a number x[i] (for the ith step). At each step, there are two choices: either proceed to the next step (i+1) or jump x[i] steps from the current step (to the i+x[i]th step). If the number written on the step is less than 0, it is possible to come down that many steps or climb one step up. Sanchit starts at the 0th step and needs to find the minimum number of jumps required to reach the top of the staircase (the nth step). If it is not possible to reach the top, -1 should be printed. Otherwise, the minimum number of jumps needed should be printed. Note that any jump resulting in a step greater than n is considered an invalid move.