#include <bits/stdc++.h>
using namespace std;

int temp[2];

int solve(){
	int N; cin>>N;
	int maxi =-1; temp[0]= temp[1]=-1;
	for(int i = 0; i<N;i++)	{ cin>>temp[i%2];	
		maxi = max(min(temp[i%2],temp[(i+1)%2]), maxi);}
	return maxi;
}

int main() {
	int cases; cin>>cases;
	while(cases--) cout<<solve()<<"\n";
	return 0;
}