#include <bits/stdc++.h>
int main() {
  int k;
  int x, tmp;
  int i, j, count = 0;
  char moji[10];
  int n = 0;
  double number[100];
  scanf("%d", &k);
  for (i = 0; i < k; i++) {
    scanf("%lf", &number[i]);
  }
  for (i = 0; i < k; ++i) {
    for (j = i + 1; j < k; ++j) {
      if (number[i] < number[j]) {
        tmp = number[i];
        number[i] = number[j];
        number[j] = tmp;
      }
    }
  }
  printf("昇順ソートした数値\n");
  for (i = 0; i < k; ++i) printf("%lf\n", number[i]);
  for (i = k - 1; i >= 1; i--) {
    number[i - 1] = (number[i] + number[i - 1]) / 2;
  }
  printf("%lf\n", number[0]);
  return 0;
}
