#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
int max, mid, min;
vector<int> nums;
scanf("%d", &n);
for(int i = 0; i < n; i++){
int num;
scanf("%d", &num);
nums.push_back(num);
}
sort(nums.begin(), nums.end());
min = nums[0];
max = nums[n - 1];
if(n % 2 == 1){
mid = nums[n / 2];
printf("%d %d %d", max, mid, min);
} else {
mid = (nums[n / 2 - 1] + nums[n / 2]);
if(mid % 2 == 0){
mid = mid / 2;
printf("%d %d %d", max, mid, min);
} else {
mid = mid / 2;
printf("%d %.1f %d", max, (double)mid + 0.5, min);
}
}
return 0;
}