 #include <algorithm>
 #include <string>

 using namespace std;

 #define ipair pair<int,int>
 #define rep(I,N) for(int I=0; I<N; I++)
 #define rrep(I,N) for(int I=N; I>=0; I--)
 #define repj(i,j,n) for(int i=j;i<n;i++)

 #define PB(a,i) (a).push_back(i)
 #define ALL(a) (a).begin(),(a).end()

 #define OK(i) cout<<"OK "<<i<<endl
 #define Yes cout<<"Yes"<<endl
 #define YES cout<<"YES"<<endl
 #define No cout<<"No"<<endl
 #define NO cout<<"NO"<<endl

 int main() {
   int N;
   cin >> N;

   int v[1000];

   rep (i, N) {
     cin >> v[i];
   }

   std::sort(v, v + N);

   rep (i, N) {
     cout << v[i] << '\n';
   }


   double ans = v[0];
   repj(i, 1, N) {
     ans = (ans + v[i]) / 2.0;
   }

   printf("%lf\n", ans);

   return 0;
 }
