/* 
 * File:   main.cpp
 * Author: semprathlon
 *
 * Created on May 14, 2016, 7:03 PM
 */

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>


using namespace std;

typedef long long ll;

const int maxn=40;

int a[maxn];

int main(int argc, char** argv) {
    int T;
    scanf("%d",&T);
    while(T--){
        int n;
        scanf("%d",&n);
        for(int i=0;i<n;i++)
            scanf("%d",&a[i]);
        std::sort(a,a+n);
        printf("%d\n",a[n-1]);
    }
    return 0;
}