#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <fstream>
#include <vector>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define INF 0x3f3f3f3f
const int N=500005;
const int mod=1e9+7;

int a[50];

int main() {
    int n,t;
    cin>>t;
    while (t--) {
        cin>>n;
        int maxx=0;
        for (int i=1; i<=n; i++) {
            scanf("%d",&a[i]);
            maxx=max(a[i],maxx);
        }
        cout<<maxx<<endl;
    }
    return 0;
}