Problem: Gildong is now developing a puzzle game. The puzzle consists of n platforms numbered from 1 to n. The player plays the game as a character that can stand on each platform and the goal of the game is to move the character from the 1-st platform to the n-th platform.

The i-th platform is labeled with an integer a_i (0 ≤ a_i ≤ n-i). When the character is standing on the i-th platform, the player can move the character to any of the j-th platforms where i+1 ≤ j ≤ i+a_i. If the character is on the i-th platform where a_i=0 and i ≠ n, the player loses the game.

Since Gildong thinks the current game is not hard enough, he wants to make it even harder. He wants to change some (possibly zero) labels to 0 so that there remains exactly one way to win. He wants to modify the game as little as possible, so he's asking you to find the minimum number of platforms that should have their labels changed. Two ways are different if and only if there exists a platform the character gets to in one way but not in the other way.

Input

Each test contains one or more test cases. The first line contains the number of test cases t (1 ≤ t ≤ 500).

Each test case contains two lines. The first line of each test case consists of an integer n (2 ≤ n ≤ 3000) — the number of platforms of the game.

The second line of each test case contains n integers. The i-th integer is a_i (0 ≤ a_i ≤ n-i) — the integer of the i-th platform.

It is guaranteed that: 

  * For each test case, there is at least one way to win initially. 
  * The sum of n in all test cases doesn't exceed 3000. 

Output

For each test case, print one integer — the minimum number of different labels that should be changed to 0 so that there remains exactly one way to win.

Example

Input


3
4
1 1 1 0
5
4 3 2 1 0
9
4 1 4 2 1 0 2 1 0


Output


0
3
2

Note

In the first case, the player can only move to the next platform until they get to the 4-th platform. Since there is already only one way to win, the answer is zero.

In the second case, Gildong can change a_2, a_3, and a_4 to 0 so that the game becomes 4 0 0 0 0. Now the only way the player can win is to move directly from the 1-st platform to the 5-th platform.

In the third case, Gildong can change a_2 and a_8 to 0, then the only way to win is to move in the following way: 1 – 3 – 7 – 9.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;

#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char *name, Arg1 &&arg1)
{
  cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args)
{
  const char *comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
#else
#define trace(...)
#endif

#define F first
#define S second
#define PB push_back
#define MP make_pair

#define FASTER                      \
  ios_base::sync_with_stdio(false); \
  cin.tie(NULL);                    \
  cout.tie(NULL);

using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
using vii = vector<ii>;
using vll = vector<ll>;

const int INF = 100000;

int main()
{
  FASTER;
  int t;
  cin >> t;
  while (t--)
  {
    int n;
    cin >> n;
    vector<int> Range(n);
    // Ri = range of i.
    for (int i = 0; i < n; i++)
    {
      cin >> Range[i];
      Range[i] += i;
    }
    // Cost[i][j].. is the number of k, i<=k<j to be set to '0' such that they can't reach j.  Cost[i][j] comes from Cost[i+1][j]. Cost[i][i] should be infinite.
    vector<vi> Cost(n, vi(n, INF));
    for (int j = n - 1; j > 0; j--)
    {
      Cost[j][j] = 0;
      for (int i = j - 1; i >= 0; i--)
      {
        Cost[i][j] = ((Range[i] >= j) ? 1 : 0) + Cost[i + 1][j];
      }
    }
    vector<vi> DP(n, vi(n, INF));
    /* 
      DP[i][j] = minimum cost such that there is exactly one way to start from i and the next jump is at j.
       i < j <= Range[i]
       Cost[i+1][j] has to be added to min(DP[j][k]) for all k st Range[i] < k <= Range[j]
       if Ri == n - 1 then, I have to go from i->n - 1.
    */

    DP[n - 1][n - 1] = 0;
    for (int i = n - 2; i >= 0; i--)
    {
      for (int j = Range[i]; j > i; j--)
      {
        int &dp = DP[i][j];
        if (j == n - 1)
        {
          dp = Cost[i + 1][n - 1];
          continue;
        }
        dp = DP[i][j + 1];
        if (Range[j] > Range[i])
          dp = min(dp, Cost[i + 1][j] + DP[j][Range[i] + 1]);
      }
    }
    cout << DP[0][1] << endl;
  }
  return 0;
}