#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
 int n;
 cin >> n;
 int a[n];
 for (int i = 0;i < n;i++)
  cin >> a[i];
 sort(a,a+n);
 cout << "So lon nhat: " << a[n-1] << '\n';
 cout << "So lon nhi: " << a[n-2] << '\n';
 cout << "So nho nhat: " << a[0] << '\n';
}

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
 int n;
 int ma,mi,nhi;
 cin >> n;
 int a[n];
 for (int i = 0;i < n;i++)
  cin >> a[i];
 ma = -1e9;mi = 1e9;nhi = -1e9;
 for (int i = 0;i < n;i++)
  ma = max(ma,a[i]), mi = min(mi,a[i]);
 for (int i = 0;i < n;i++)
  if (a[i] > nhi && a[i] < ma)
   nhi = a[i];
 cout << "So lon nhat: " << ma << '\n';
 cout << "So lon nhi: " << nhi << '\n';
 cout << "So nho nhat: " << mi << '\n';
}