// 私は猫です

#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define inf 1000000000
#define infll 1000000000000000000ll
#define pii pair<int,int>
#define rep(i,a,b,c) for(int i=(a);i<=(b);i+=(c))
#define per(i,a,b,c) for(int i=(a);i>=(b);i-=(c))
#define F(i,a,b) for(int i=(a);i<=(b);i++)
#define dF(i,a,b) for(int i=(a);i>=(b);i--)
#define cmh(sjy) while(sjy--)
#define lowbit(x) (x&(-x))
#define HH printf("\n")
#define eb emplace_back
#define poly vector<int>
using namespace std;
ll read(){
	ll x=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
	while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return x*f;
}
const int mod=998244353,maxn=500005;
inline void chkmax(int &x,int y){ x=max(x,y); }
inline void chkmin(int &x,int y){ x=min(x,y); }
int f[5005][5005][2],a[maxn],n;
void solve(){
	n=read();
	F(i,1,n)a[i]=read();
	if(n==1)return printf("%d\n",a[1]),void();
	if(!(n&1)){
		int mid=n>>1;
		if(a[mid]>a[mid+1])printf("%d\n",a[mid]);
		else printf("%d\n",a[mid+1]);
	}else{
		int mid=(n+1)>>1,x=a[mid-1],y=a[mid],z=a[mid+1];
		printf("%d\n",max(min(y,z),min(x,y)));
	}
}
signed main(){
	int sjy=read();
	cmh(sjy) solve();
}