1778A - Flip Flop Sum - 800

def solve():
    n = int(input())
    ar = list(map(int, input().split()))
    
    s = 0 # sum
 
    # three conditions: all 1, all -1, at least one -1
    has_diff = False
    has2_positive = 0
    has2_negative = 0
 
    s += ar[0]
    for idx in range(1, n):
        if ar[idx] == ar[idx-1]:
            if ar[idx] == -1:
                has2_negative = 4 # -2 -> +2, diff 4
            else:
                has2_positive = -4 # +2 => +1, diff 1
        else:
            has_diff = True
        s += ar[idx]
 
    if has2_negative:
        s += has2_negative
    elif has_diff:
        ...
    elif has2_positive:
        s += has2_positive
    print(s)

for _ in range(int(input())):
    solve()

def solve():
    n = int(input())
    ar = list(map(int, input().split()))
    res = sum(ar)

    for i in range(n-1):
        if ar[i] == ar[i+1] == -1:
            print(res + 4)
            return
    if res == n:
        res -= 4
    print(res)

for _ in range(int(input())):
    solve()