package ccf2019_3;
import java.util.Scanner;
public class MinMidMax {
public static void main(String[] args) {
int min,max;
double mid;
Scanner in = new Scanner(System.in);
int n =in.nextInt();
int[] arr = new int[n];
for(int i = 0;i<arr.length;i++){
arr[i] = in.nextInt();
}
min = arr[0]>arr[n-1]?arr[0]:arr[n-1];
max = arr[0]<arr[n-1]?arr[0]:arr[n-1];
if(n%2==0){
mid=(arr[n/2]+arr[n/2+1])/2;
}
else{
mid = arr[n/2];
}
System.out.println(max+" "+mid+" "+min);
}
}