// Problem: G. Matching
// Contest: Codeforces - The 13th Shandong ICPC Provincial Collegiate Programming Contest
// URL: https://codeforces.com/gym/104417/problem/G
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

/*
   /\__/\
  (o    o)
  /      \
 // ^  ^ \\
///      \\\
  \      /
   \____/
  /\_  _/\
 */
#include<bits/stdc++.h>

#define fir first
#define sec second
#define pb push_back
#define lowbit(X) X&(-X)
#define sz(X) (int)(X).size()
#define all(X) (X).begin(),(X).end()

#define YES cout<<"YES"<<'\n'
#define Yes cout<<"Yes"<<'\n'
#define NO cout<<"NO"<<'\n'
#define No cout<<"No"<<'\n'
#define error cout<<"-1"<<'\n'

using namespace std;
typedef long long unt;
typedef long double ld;
typedef vector<int> vt_int;
typedef vector<char> vt_char;
typedef vector<bool> vt_bool;
typedef vector<long long> vt_unt;
typedef vector<long double> vt_ld;
typedef vector<vector<int> > vvt_int;
typedef vector<vector<char> > vvt_char;
typedef vector<vector<bool> > vvt_bool;
typedef vector<vector<long long> > vvt_unt;
typedef vector<vector<long double> > vvt_ld;

const long long mod=1e9+7;
const long long INF=1152921504606846976;//(2^60)
const long long N=110000;

int solve(){
    unt n;
    cin>>n;
    vt_unt a(n+10);
    
    unt ans=0;
    vector<pair<unt,unt> >t;
    for(int i=1;i<=n;i++){
    	cin>>a[i];
    	unt res=i-a[i];	
    	t.push_back({res,a[i]});
    	
    	
    	//cout<<res<<" ";
    }
    //cout<<endl;
    sort(all(t));
    //reverse(all(t));
    map<int,int>vis;
    for(int i=n-1;i-1>=0;i--){
    	if(t[i].fir==t[i-1].fir&&!vis[i]){
    		// unt res=t[i].sec+t[i-1].sec;
    		// if(res>0){
    			// ans+=res;
    			// i--;
    			// continue;
    		// }
    		ans+=max(0ll,t[i].sec+t[i-1].sec);
    		vis[i]=vis[i-1]=true;
    		//i--;
    	}
    }
    cout<<ans<<endl;
    return 0;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int testcase;
    testcase=1;
    cin>>testcase;
    while(testcase--){
        int flag=solve();
        
        if(flag==1) YES;
        if(flag==-1) NO;
    }
    return 0;
}