#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

void solve(){
  int n;
  cin >> n;
  vector<long long> a(n);
  for(int i = 0; i < n; i++){
    cin >> a[i];
  }
  if(n >= 5000){
    cout << -1 << endl;
    return;
  }
  vector<long long> s(n + 1, 0);
  for(int i = 0; i < n; i++){
    s[i + 1] = s[i] + a[i];
  }
  long long ans = 0;
  for(int i = 0; i < n; i++){
    for(int j = i + 1; j < n - 1; j++){
      ans = max(ans, abs(s[i + 1]) + abs(s[j + 1] - s[i + 1]) + abs(s[n] - s[j + 1]));
    }
  }
  cout << ans << endl;
}

int main(){
  int t;
  cin >> t;
  while(t--){
    solve();
  }
}