#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
double ans,a[110];int n;
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%lf",&a[i]);
	sort(a+1,a+n+1);
	for(int i=2;i<n;i++)ans+=a[i];
	ans/=double(n-2.0);
	printf("%.2lf %.2lf",ans,max(ans-a[2],a[n-1]-ans));
	return 0;
}