#include <bits/stdc++.h>
using namespace std;
 
#define fast_io ios::sync_with_stdio(false); cin.tie(NULL)
#define int long long
 
void solve() {
    int n;
    cin >> n;
 
    vector<int> a(n);
    int sum = 0,maximum=0;
 
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        sum += a[i];
        if(a[i]<2*(i+1)){
        	maximum=max(maximum,2*(i+1)-a[i]);
        }
    }
 
    cout << max((n+1)*n,sum+maximum) << "\n";
}
 
int32_t main() {
    fast_io;
    int t;
    cin >> t;
    while (t--) solve();
    return 0;
}
 

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgojZGVmaW5lIGZhc3RfaW8gaW9zOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOyBjaW4udGllKE5VTEwpCiNkZWZpbmUgaW50IGxvbmcgbG9uZwoKdm9pZCBzb2x2ZSgpIHsKICAgIGludCBuOwogICAgY2luID4+IG47CgogICAgdmVjdG9yPGludD4gYShuKTsKICAgIGludCBzdW0gPSAwLG1heGltdW09MDsKCiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewogICAgICAgIGNpbiA+PiBhW2ldOwogICAgICAgIHN1bSArPSBhW2ldOwogICAgICAgIGlmKGFbaV08MiooaSsxKSl7CiAgICAgICAgCW1heGltdW09bWF4KG1heGltdW0sMiooaSsxKS1hW2ldKTsKICAgICAgICB9CiAgICB9CgogICAgY291dCA8PCBtYXgoKG4rMSkqbixzdW0rbWF4aW11bSkgPDwgIlxuIjsKfQoKaW50MzJfdCBtYWluKCkgewogICAgZmFzdF9pbzsKICAgIGludCB0OwogICAgY2luID4+IHQ7CiAgICB3aGlsZSAodC0tKSBzb2x2ZSgpOwogICAgcmV0dXJuIDA7Cn0K

NAozCjIgNSAxCjIKNCA0CjQKMSAzIDIgMQo1CjMgMiAwIDkgMTAK

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