#include<bits/stdc++.h>
using namespace std;
#define ll long long

void solve() {
	int n;
	cin >> n;
	vector<int> a(n + 1);
	ll ans = 0;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	vector<int> vis(n + 1);
	for(int i = 1; i <= n; i++) {
		if(!vis[i]) {
			vector<int> g;
			g.push_back(a[i]);
			vis[i] = 1;
			for(int j = i + 1; j <= n; j++) {
				if(a[j] <= 0)continue;
				if(vis[j])continue;
				if(i - j == a[i] - a[j]) {
					g.push_back(a[j]);
					vis[j] = 1;
				}
			}
			sort(g.begin(), g.end(), greater<>());
			for(int u: g){
				ans += u;
				// cout << u << ' ';
			}
			// cout << endl;
			if(g.size() % 2)ans -= g[g.size() - 1];
		}
	}
	cout << ans << endl;
}

int main() {
	int t = 1;
	cin >> t;
	while(t--) {
		solve();
	}
	return 0;
}