#include <iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include <algorithm>
using namespace std;
double a[1000001];
int cmp(const void *a, const void *b)
{
return *(double *)a>*(double *)b?1:-1;
}
int main()
{
int n;
while(cin>>n)
{
for(int i=0;i<n;i++)
cin>>a[i];
qsort(a,n,sizeof(a[0]),cmp);
printf("%.2lf %.2lf %.2lf\n",a[n-1],a[n-2],a[n-3]);
}
return 0;
}
