#include <stdio.h>
#include <stdlib.h>

#define SWAP(a,b) {int temp;temp=a;a=b;b=temp;}

void quicksort(int *seq,int size);
void sub_quicksort(int *seq,int left,int right);


int main(void){

  int size;
  int *seq;
  double value=0.0;

  scanf("%d",&size);

  if((seq=malloc(size*sizeof(int)))==NULL){
    printf("error");
    exit(1);
  }

  for(int i=0;i<size;i++){
    scanf("%d",&seq[i]);
  }

  quicksort(seq,size);
  for(int i=0;i<size;i++){
    printf("%d",seq[i]);
  }
  value=seq[0];
  for(int i=1;i<size;i++){
    value=(value+seq[i])/2.0;
  }

  printf("%f",value);

  free((void *)seq);

}

void quicksort(int *seq,int size){

  sub_quicksort(seq,0,size-1);

}


void sub_quicksort(int *seq,int left,int right){
  int pivot=seq[(left+right)/2];
  int left_index=left;
  int right_index=right;

  while(left_index<=right_index){
    for(;seq[left_index]<pivot;left_index++);
    for(;seq[right_index]>pivot;right_index--);

    if(left_index<=right_index){
      SWAP(seq[left_index],seq[right_index]);
      left_index++;
      right_index--;
    }
  }
  if(right_index>left){
    sub_quicksort(seq,left,right_index);
  }
  if(left_index<right){
    sub_quicksort(seq,left_index,right);
  }
}
