#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
void solve() {
	int n; cin >> n;
	vector<long long> a(n);
	long long sum = 0;
	rep(i, n) {
		cin >> a[i];
		sum += a[i];
	}
	long long ans = abs(a[0]) + abs(a[1]) + abs(sum - a[0] - a[1]);
	long long psum = a[0] + a[1];
	long long pmin = min(psum, a[0]);
	long long pmax = max(psum, a[0]);
	rep2(i, 2, n - 1) {
		psum += a[i];
		long long val0 = abs(pmin) + abs(psum - pmin) + abs(sum - psum);
		long long val1 = abs(pmax) + abs(psum - pmax) + abs(sum - psum);
		chmax(ans, val0);
		chmax(ans, val1);

		chmin(pmin, psum);
		chmax(pmax, psum);
	}
	cout << ans << endl;
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t; cin >> t;
	while (t--) solve();
	return 0;
}