for _ in range(int(input())):
    n = int(input())
    a = list(map(int, input().split()))
    flag = True
    sm = 0
    for i in range(n - 1):
        if(a[i] >= 180):
            flag = False
        sm += a[i]
    if(flag and sm < (n - 2)*180 and ((n - 2)*180) - sm < 180):
        print(((n - 2)*180) - sm)
    else:
        print(-1)

#include<bits/stdc++.h>

using namespace std;

void solve(){
    // n >= 3
    long long n; cin >> n;
    long long sm = 0;
    bool flag = false;
    for(long long i = 0; i < n - 1; i++){
        long long x; cin >> x;
        sm += x;
        if(x >= 180) flag = true;
    }
    
    if(flag){
        cout << (-1) << "\n";
        return;
    }
    
    if(sm < (n - 2)*180 and ((n-2)*180) - sm < 180){
        cout << ((n-2)*180) - sm << "\n";
    } else {
        cout << (-1) << "\n";
    }
}

int main(){
    // For Fast IO
    ios::sync_with_stdio(0);
    cin.tie(nullptr); cout.tie(nullptr);

    long long T; cin >> T;
    while(T--)
    solve();

    return 0;
}

from collections import defaultdict
for _ in range(int(input())):
    n = input()
    dt = defaultdict(int)
    for i in n:
        dt[ord(i)] += 1
    print(len(dt))

#include <bits/stdc++.h>
using namespace std ;
int main(){
    int t ; cin >> t ;
    while(t--){
        set<char> s ;
        string st ; cin >> st ;
        for(auto x : st){
            s.insert(x);
        }
        cout << s.size() << endl ;
    }
    return 0 ;
}

n = int(input())
a = list(map(int, input().split()))
i, j, flag  = 0, n - 1, True
while(i < j):
    if(a[i] != a[j]):
        flag = False
        print("L LAG GAYE")
        break
    i += 1
    j -= 1
if(flag):
    print("YOU WILL GET ACTION")

#include <bits/stdc++.h>
using namespace std ;
int main(){
    int t = 1 ;
    while(t--){
        int n ; cin >> n ;
        int arr[n], b[n];
        for(int i = 0 ; i < n ; i++){
            cin >> arr[i];
        }
        bool ans = true;
        for(int i = 0 ; i <= n/2 ; i++){
            if(arr[i] != arr[n-i-1]){
                ans = false;
                break;
            }
        }
        (ans)?cout << "YOU WILL GET ACTION\n":cout << "L LAG GAYE\n";
    }
    return 0 ;
}

for _ in range(int(input())):
    n = int(input())
    a = ''.join(sorted(list(map(str, input().split())), reverse = True))
    print(a)

#include <bits/stdc++.h>
using namespace std ;
int main(){
    int t = 1 ; cin >> t ;
    while(t--){
        int n ; cin >> n ;
        int arr[n];
        for(int i = 0 ; i < n ; i++){
            cin >> arr[i];
        }
        sort(arr, arr+n, greater<int>());
        for(int i = 0 ; i < n ; i++){
            cout << arr[i];
        }cout << endl;
    }
    return 0 ;
}

n = int(input())
a = input()
ones, twos = 0, 0
for i in a:
    if i == '0':
        ones += 1
    else:
        twos += 1
if(n % 2 == 0 and twos == ones):
    print("YES")
elif(n % 2 == 1 and (twos + 1 == ones or ones + 1 == twos)):
    print("YES")
else:
    print("NO")

#include <bits/stdc++.h>
using namespace std ;
int main(){
    int t = 1 ;
    while(t--){
        int n ; cin >> n ;
        string s ; cin >> s ;
        (abs(count(s.begin(),s.end(), '0') - (count(s.begin(), s.end(), '1'))) <= 1)?cout << "YES":cout << "NO";
    }
    return 0 ;
}

n, q = map(int, input().split())
a = list(map(int, input().split()))
pre = [ 0 for i in range(n) ]
sm = 0
for i in range(n):
    sm ^= a[i]
    pre[i] = sm

for _ in range(q):
    l, r = map(int, input().split())
    l, r = l - 1, r - 1
    if(l - 1 < 0):
        print(pre[r])
    else:
        print(pre[r]^pre[l-1])

#include <bits/stdc++.h>
using namespace std ;
int main(){
    int t = 1 ;
    while(t--){
        int n, q ; cin >> n >> q;
        vector<int> v(n);
        for(auto &x : v){
            cin >> x ;
        }
        for(int i = 1 ; i < n ; i++){
            v[i] = (int)(v[i]^v[i-1]);
        }

        while(q--){
            int l , r ; cin >> l >> r ;
            if(l == 1){
                cout << v[r-1] << endl;
                continue;
            }
            cout << int(v[r-1]^v[l-2]) << endl;
        }
    }
    return 0 ;
}