//MJRT
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//////////////////////
#include<iostream>
#include<algorithm>
#include<string>
#include <iterator>
#include<sstream>
#include<functional>
#include<numeric>
///////////////////////
#include<vector>
#include<map>
#include <stack>
#include<queue>
#include<set>
#include <bitset>
#include <list>
using namespace std;
#define lch(x)  ((x) << 1)
#define rch(x) ((x)<<1|1)
#define dad(x) ((x)>>1)
#define lowbit(x) ((x)&(-x))
static int INDEX = 0,BUGs = 0;
#define BUG() cout << "There is BUG No." << BUGs++ <<endl;
#define Whats(x) cout << "{ "<< #x << " }" << " is " << "*** "<< x << " ***" << "  index:" << INDEX++ <<endl;
#define Show(x,s,l)         cout << #x << ": "; for(int i = s ; i < s+l ; i++) cout << x[i] << " ";  cout << "\n";
#define Clear(name, init) memset(name, init, sizeof(name));
typedef  long long int LL;
const int INF = ~0U>>1;

//const int N = 5 + ;
int a[30];
int main()
{
    //ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
#endif
    int Case,n;
    scanf("%d",&Case);
    while(Case--)
    {
        scanf("%d",&n);
        for(int i = 0 ; i < n ; i++)    scanf("%d",&a[i]);
        int res = 0;
        for(int i = 0 ; i < n ; i++)
        {
            for(int j = i-1 ; j >=0 ; j--)
            {
                if(a[i]<a[j])
                {
                    res = max(res,a[i]);
                    break;
                }
            }

        }
        printf("%d\n",res);
    }
    return 0;
}