/*
Optimal Vent Sort

by Raymond Le Grand

Note: Mean, median, mode.
*/

#include<iostream>
#include<stdlib.h>
#include<vector>

using namespace std;

int dist(int x, int y){
  return abs(x-y);
}

static int compareit(const void *a, const void *b){
  int i=*(int *)(a);
  int j=*(int *)(b);
  return(i-j);
}

int main(){
  int a,b;
  string locName;
  int loc[10];
  int length;

  while(true){
    cin>>locName;
    if (cin.eof()) break;
    cout<<locName;

    cin>>length;
    for(int i=0;i<length;i++){
      cin>>a;
      loc[i]=a;
    }
   
    qsort(loc,length,sizeof(int),compareit);

    b=(length/2)-1+(length%2);
    a=0;
    for(int i=0;i<length;i++){
      if (i!=b) a+=dist((int)loc[b],(int)loc[i]);
    }    
    cout<<' '<<loc[b]<<' '<<a<<endl;
  }
    return 0;
}