#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <string>
#include <iostream>
#define INF 0x3f3f3f3f
#define ll long long
#define mod 1000000009
#define endl '\n'
using namespace std;
#define For(i,N) for(int i=1;i<=N;i++)
#define LL long long


int N,M;
int T;
int X[40];
int F[40][40];
LL odd=0,even=0;

int main()
{
    cin>>T;
    
    while(T--)
    {
        scanf("%d",&N);
        
        For(i,N)
        {
            scanf("%d",&X[i]);
        }
        
    /*
    For(i,N)
        {
            int K=X[i];
            for(int j=1;j<=N;j++)
            {
                F[i][j]=min(K,X[j]);
                if((j-i+1)%2==0)+=min(K,X[j]);
                K=min(K,X[j]);
            }
        }
        */
        sort(X+1,X+N+1);
        
        cout<<X[N]<<endl;
        
    }
    
    
    
    
    
    return 0;
}