/*#include <stdio.h>
int a[10001];
int n, i, j, b, temp;
int main()
{
scanf("%d", &n);
for (i=1; i<=n; i++)
{
scanf("%d", &a[i]);
}
for(i=1; i<n; i++)
{
b=0;
for(j=1; j<=n-i; j++)
{
if (a[j] > a[j+1])
{
temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
b++;
}
}
if(b==0)
{
break;
}
}
printf("%d",i-1);
}
*/
#include <stdio.h>
int a[10001];
int n, i, j, temp, key;
void qkrnj(int x, int y)
{
temp = x;
x = y;
y = temp;
}
int main()
{
scanf("%d", &n);
for (i=1; i<=n; i++)
{
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++)
{#include <stdio.h>
int a[10001];
int i, j, x, temp;
int main()
{
for (i=1; i<=5; i++)
{
scanf("%d", &a[i]);
x+=a[i];
}
for(i=1; i<5; i++)
{
for(j=1; j<=5-i; j++)
{
if (a[j] > a[j+1])
{
temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
printf("%d\n%d",x/5,a[3]);
}
printf("%d ", a[i]);
}
}
/*
#include <stdio.h>
int a[10001];
int i, j, x, temp;
int main()
{
for (i=1; i<=5; i++)
{
scanf("%d", &a[i]);
x+=a[i];
}
for(i=1; i<5; i++)
{
for(j=1; j<=5-i; j++)
{
if (a[j] > a[j+1])
{
temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
printf("%d\n%d",x/5,a[3]);
}
*/