#include <iostream>
    #include <vector>
    #include <cstdio>
    #include <cstring>
    #include <cmath>
    #include <algorithm>
    using namespace std;
    int n,m,t;
    int arr[25],arr2[25];
    int main()
    {
//        freopen("input.txt","r",stdin);
        scanf("%d",&t);
        int Case=1;
        while(t--)
        {
            scanf("%d",&n);
            memset(arr,0,sizeof(arr));
            memset(arr2,0,sizeof(arr2));
            for(int i=1;i<=n;++i)
            {
                scanf("%d",&arr[i]);
                arr2[arr[i]]=i;
            }
            vector < int > ans;
            for(int i=1;i<=n;++i)
            {
                int tmp=arr[i];
                for(int j=1;j < i;++j)
                {
                    if(arr[j] > tmp)
                    {
                        ans.push_back(tmp);
                        break;
                    }
                }
            }
            int Max=0;
            for(int i=0;i<ans.size();++i)
            {
                Max=max(Max,ans[i]);
            }
            printf("%d\n",Max);
        }
        return 0;
    }