#include <iostream>
#include <bits/stdc++.h> 
typedef long long ll; 

using namespace std;
const int N = 105; 

int dp[N][N][N]; 
int vis[N][N][N]; 

int n; 
int test_no; 
vector<int>a; 
int solve(int i, int l, int r){
	if(i == (n+1) ){
          if(l == 0 && r == n) return 0; 
          else return 1e8; 
    }
	if(vis[i][l][r] == test_no) return dp[i][l][r] ;  
    vis[i][l][r] = test_no; 
     int new_l = max(0, i - a[i]); 
     new_l = min(l, new_l); 
     int new_r = min(n, i + a[i] - 1); 
     new_r = max(r, new_r); 
     int op1 = 1 + solve(i+1, new_l, r); 
     int op2 = 1 + solve(i+1, l, new_r); 
     int op3; 
     if(i > r && l == 0) op3 = solve(i+1,i,r);
     else op3 = solve(i+1,l,r); 
     return dp[i][l][r] = min(op1, min(op2, op3)); 
	
}
int main() {
	ios_base::sync_with_stdio(false); 
    cin.tie(NULL); cout.tie(NULL); 
    int t; cin>>t;  
    for(int i = 1; i <= t; i++){
         test_no = i; 
        cin>>n; 
        a.clear(); a.resize(n+1); 
         for(int i = 1 ; i<= n ; i++) cin>>a[i]; 
         cout<<solve(1,1,0)<<endl;
    }
}