#include<iostream>
#include<algorithm>
#include<string.h>
#include<string>
#include<stdio.h>
#include<math.h>
#include<stack>
#include<queue>
#include<math.h>
#include<map>
#include<vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
#define min(a,b) (a>b?b:a)
#define max(a,b) (a>b?a:b)
#define mem(a,num) memset(a,num,sizeof(a))
#define inf(a,n) fill(a,a+n,0x3f3f3f3f)

int main()
{
    ios::sync_with_stdio(false);
    int T,n,a[35];
    cin>>T;
    while(T--)
    {
        cin>>n;
        for(int i=0;i<n;++i)cin>>a[i];
        sort(a,a+n);
        cout<<a[n-1]<<endl;
    }
    return 0;
}