#include<bits/stdc++.h>
using namespace std;
void func(){
int a[510];
int cnt=0,maxn=-2147483647,minn=2147483647;
for(int i=1;i<=250;++i){
cin>>a[i];
maxn=max(maxn,a[i]),minn=min(a[i],minn),cnt+=a[i];
}
double x=cnt/250.0;
int tot=0;
for(int i=1;i<=250;++i){
if(fabs(a[i]-x)<=x/2) ++tot;
}
if(tot/250.0>0.75) cout<<(int)round(x)<<"\n";
else cout<<(maxn+minn)/2<<"\n";
}
int main(){
int n;
cin>>n;
for(int i=1;i<=n;++i) func();
return 0;
}
1506A - Strange Table | 456A - Laptops |
855B - Marvolo Gaunt's Ring | 1454A - Special Permutation |
1359A - Berland Poker | 459A - Pashmak and Garden |
1327B - Princesses and Princes | 1450F - The Struggling Contestant |
1399B - Gifts Fixing | 1138A - Sushi for Two |
982C - Cut 'em all | 931A - Friends Meeting |
1594A - Consecutive Sum Riddle | 1466A - Bovine Dilemma |
454A - Little Pony and Crystal Mine | 2A - Winner |
1622B - Berland Music | 1139B - Chocolates |
1371A - Magical Sticks | 1253A - Single Push |
706B - Interesting drink | 1265A - Beautiful String |
214A - System of Equations | 287A - IQ Test |
1108A - Two distinct points | 1064A - Make a triangle |
1245C - Constanze's Machine | 1005A - Tanya and Stairways |
1663F - In Every Generation | 1108B - Divisors of Two Integers |