#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#define REP(i,a,b) for(int i=a;i!=b+1;++i)
#define CLR(c,x) memset(c,x,sizeof(c))
#define INF ~0U>>2
using namespace std;

void setIO(string s){
	string in=s+".in",out=s+".out";
	freopen(in.c_str(),"r",stdin);
	freopen(out.c_str(),"w",stdout);
}

vector<int>V;

int main(){
	setIO("stats");
	
	int n,sum=0,t;
	scanf("%d",&n);
	REP(i,1,n){
	    scanf("%d",&t);
	    V.push_back(t);
	    sum+=t;
	}
	sort(V.begin(),V.end());
	
	printf("%.6lf\n",(double)sum/n);
	printf("%.6lf\n",(n&1)?V[n/2]:(V[n/2-1]+V[n/2])/2.0);
	
	return 0;
	
}