#include<bits/stdc++.h>
using namespace std;
int maxx=-100000000,minn=1000000000;
int main(){
    vector<int> b;
    long long n,a[1000],ans=0;
    double sb;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>sb;
        maxx=max(maxx,sb);
        minn=min(minn,sb);
        ans+=sb;
        b.push_back(sb);
    }
    ans=1.0*(ans-maxx-minn)/(n-2);
    for(int i=1;i<=n;i++){
        a[i]=pow(b[i-1]-ans);
    }
    sort(a+1,a+n);
    cout<<fixed<<setprecision(2)<<ans<<" "<<a[n];
    return 0;
}