ccf 201903-1

#include<iostream>
#include<cstdio> 
#include<vector>
#include<algorithm>
using namespace std;
int main(){
	int n;
	int max,min;
	double med;
	vector<int> v;
	cin >> n;
	for(int i = 0;i < n;i++){
		int a;
		cin >> a;
		v.push_back(a);
	}
	sort(v.begin(),v.end());
	cout << v[n-1] << " ";
	if(n%2==0){
		int a;
		double b;
		double c;
		a = (v[n/2]+v[n/2-1])/2;
		b = (v[n/2]+v[n/2-1])*1.0/2;
		c = b;
		if(b > a){
			printf("%.1f ",c);
		}else{
			printf("%d ",a);
		}
	}else{
		cout << v[n/2] << " ";
	}
	cout << v[0] << endl;
	return 0;
}