//Mashiroqwq
#include<bits/stdc++.h>

#define vc vector
#define db double
#define fi first
#define se second
#define ll long long
#define mk make_pair
#define pb push_back
#define RI register int
#define PI pair<int,int>
#define ull unsigned long long
#define err cerr << "   -_-   " << endl
#define debug cerr << " ------------------- " << endl

#define input(x) freopen(#x".in","r",stdin)
#define output(x) freopen(#x".out","w",stdout)

#define NO puts("No")
#define YES puts("Yes")

//#define OccDreamer
//#define int long long

using namespace std;

namespace IO{
	inline int read(){
		int X=0, W=0; char ch=getchar();
		while(!isdigit(ch)) W|=ch=='-', ch=getchar();
		while(isdigit(ch)) X=(X<<1)+(X<<3)+(ch^48), ch=getchar();
		return W?-X:X;
	}
	inline void write(int x){
		if(x<0) x=-x, putchar('-');
		if(x>9) write(x/10);
		putchar(x%10+'0');
	}
	inline void sprint(int x){write(x), putchar(32);}
	inline void eprint(int x){write(x), putchar(10);}
}using namespace IO;

const int MAXN = 1e5+5;
const int mod = 998244353;

int n;
int a[MAXN], b[MAXN], c[MAXN];

bool f[1003][1003];
bool vis[1003][1003];

inline bool dfs(int l, int r){
	if(l==r) return c[l];
	if(vis[l][r]) return f[l][r];
	vis[l][r]=1; int o=l-1+n-r;
	if(o&1){
		if(dfs(l+1,r)==0 || dfs(l,r-1)==0) f[l][r]=0;
		else f[l][r]=1;	
	}
	else{
		if(dfs(l+1,r)==1 || dfs(l,r-1)==1) f[l][r]=1;
		else f[l][r]=0;	
	}
	return f[l][r];
}

inline bool check(int lim){
	for(int i=1;i<=n;++i) c[i]=a[i]>=lim, cout << c[i] << ' ';
	cout << endl;
	memset(vis,0,sizeof vis); bool res=dfs(1,n);
	for(int i=2;i<=n;++i, cout << endl)
		for(int j=1, k=i;k<=n;++j, ++k) cout << f[j][k] << ' ';
	cout << endl;
	return res;
}

inline void solve(){
	n=read();	
	for(int i=1;i<=n;++i) a[i]=read(), b[i]=a[i];
	if(n==1) return eprint(a[1]), void();
	if(n%2==0) eprint(max(a[n/2],a[n/2+1]));
	else eprint(max(min(a[n/2],a[n/2+1]),min(a[n/2+1],a[n/2+2])));
}

signed main(){
	int t=read();
	while(t--) solve();
	return 0;
}