def solve():
  n = int(input())
  a = list(map(int, input().split()))
  s = sum(a)
  ans = abs(a[0]) + abs(a[1]) + abs(s - a[0] - a[1])
  pf = a[0] + a[1]
  pfmin = min(pf, a[0])
  pfmax = max(pf, a[0])
  for j in range(2, n - 1):
    pf += a[j]
    ans = max(ans, max(abs(pfmin) + abs(pf - pfmin), abs(pfmax) + abs(pf - pfmax)) + abs(s - pf))
    pfmin = min(pf, pfmin)
    pfmax = max(pf, pfmax)
  print(ans)

t = int(input())
for i in range(t):
  solve()