#include <cstring>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const int N = 50;
int a[N];

int main() {
    int T, n;
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        int ans = -1;
        for (int i = 0; i < n; ++i) {
            scanf("%d", &a[i]);
            ans = max(ans, a[i]);
        }
        printf("%d\n", ans);
    }
    return 0;
}