#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;
}

#include <bits/stdc++.h>
using namespace std;
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        int n,cnt,i=0;
        scanf("%d",&n);
        cnt=n;int a[100]={0};
        while(n--){
                scanf("%d",&a[i]);
                i++;
           }
        sort(a,a+cnt);
        printf("%d\n",a[cnt/2]);
      }
}

#include <stdio.h> int main() { int T; scanf("%d",&T); while(T--) { int n; scanf("%d",&n); int age[n]; for(int i=0;i<n;i++) { scanf("%d",&age[i]); } for(int i=0;i<n-1;i++) { for(int j=0;j<n-i-1;j++) { if(age[j]>age[j+1]) { int temp=age[j]; age[j]=age[j+1]; age[j+1]=temp; } } } if(n%2==0) { printf("%d\n",age[n/2]); } else { printf("%d\n",age[n/2]); } } return 0; }