#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
int main ()
{
int a[110],i,n;
while(cin>>n,n)
{
for( i = 0; i < n; i++)
{
cin>>a[i];
}
sort(a,a+n);
if(n % 2 == 0)
{
int k = n/2;
cout<<(a[k-1] + a[k] )/2.0<<endl;
}
else
{
cout<<a[n/2]<<endl;
}
}
return 0;
}