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