#include <cstdio>
#include <iostream>
#include <cmath>
#include <iomanip>
#include <algorithm>
using namespace std;
long long  tol=0,m,cha;
double n,minn=10000000000,q,maxn=0;
int main()
    {
	cin>>m;
	for(int i=1;i<=m;i++)
	{
	cin>>n;	
	tol+=n;
	
	for(int j=1;j<=n;j++)
	maxn=max(maxn,n);
	
	for(int k=n;k>=1;k--)
	minn=min(minn,n);
		
	}	
	tol=tol-maxn-minn;
	q=tol*1.0/(m-2);
	
	for(int q=1;q<=m;q++)
	{
		
	if(q!=maxn&&q!=minn)
	cha=fabs(n-q);
	}
	cout<<fixed<<setprecision(2)<<q*1.0<<" "<<cha*1.0;
	return 0;
	}