#include <stdio.h>
int a[20];
int main()
{
	int T,i,n,l,j,M;
	scanf ("%d",&T);
	for (l=1;l<=T;l++)
	{
		scanf ("%d",&n);
		for (i=1;i<=n;i++)
		{
			scanf ("%d",&a[i]);
		}
		for (i=1;i<=n;i++)//冒泡排序
		{
			for (j=1;j<n;j++)//排序次数为n-1次
			{
				if (a[j]>=a[j+1])
				{
					M=a[j];
					a[j]=a[j+1];
					a[j+1]=M;
				}
			}
		}
		printf ("%d\n",a[n/2+1]);
	}
	return 0;
}