# Steps Easy

**Statement**

An array A of N elements are given. Each element in array represents max distance that can be covered from that element in just one jump. You have to reach the n

^{th}element in minimum no of jumps.

First line of input contains no. of test cases T

First line of each test case contains N

N integers of array A follows

**Input**

```
```

1

9

3 2 2 1 5 6 4 1 2

**Output**

```
```

3

**Constraints**

```
```

t <= 100

n <= 100

1 <= A(i) <= 10

**Languages:**Brain,C,C++,Java,Pascal,Perl,PHP,Python,Ruby,Text