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

void solve() {
    long long int n;
    cin >> n;
    long long int ar[n], dp[n+1] = {0};

  for(auto &i : ar)
    cin >> i;

  dp[n-1] = ar[n-1] * n;

  for(int i = n - 2; i >= 0; --i) {
    long long int val_1 = ar[i] * (i + 1) + dp[i+1];
    long long val_2 = ar[i] * (i + 2) + ar[i+1] * (i + 1) + dp[i+2];
    dp[i] = max(val_1, val_2);
  }

  cout << dp[0] << endl;
}

int main() {
    int test;
    cin >> test;

    while(test--)
        solve();

    return 0;
}