#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<string.h>
#include<algorithm>
#include<cstdio>
using namespace std;
#define sz(v) (int)(v.size())
#define rep(i,a,n) for(int i=a;i<n;++i)
#define per(i,a,n) for(int i=n-1;i>=a;--i)
#define mem(a,t) memset(a,t,sizeof(a))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define LL __int64
#define ULL unsigned long long
const int mod=1e9+7;
#define N 1005
const int m=26;
int a[N];
int main()
{
    //freopen("in.txt","r",stdin);
    int T,n;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        rep(i,0,n){
            scanf("%d",&a[i]);
        }
        sort(a,a+n);
        cout<<a[n-1]<<endl;
    }
    return 0;
}