#include <iostream>
#include <fstream>
#include <algorithm>
#include <climits>
#include <vector>

using namespace std;
ifstream f("secv.in");
ofstream g("secv.out");

int n, mn = 20000000, mx, v[5002], x[5002],u, ok;

vector <int> k,minim,maxim;

int main()
{
    f >> n;
    for (int i = 1; i <= n; i++){
        f >> v[i];
        if (mn > v[i]){
            mn = v[i];
        }
        if (mx < v[i]){
            mx = v[i];
        }
        x[i] = v[i];
    }
    for (int i = 1; i <= n; i++){
        if (v[i] == mn) minim.push_back(i);
        if (v[i] == mx) maxim.push_back(i);
    }
    sort (v + 1,v + n + 1);
    for (int i = 2; i <= n; i++){
        if (v[i] != v[i-1]) k.push_back(v[i-1]);
    }

    for (int i = 0; i <= minim.size()-1; i++)
        for (int j = 0; j <= maxim.size()-1; j++){
            for (int u = 0; u <= k.size()-1; u++){
                for (int h = minim[i]; h <= maxim[j]; h++)
                    if (k[u] == x[h]) {ok = 1; break;}
                    else ok = 0;
                if (ok == 1){
                    for (int h = minim[i]; h <= maxim[j]; h++)
                        g << x[h] << " "; return 0;
                }
            }
    }

    return 0;
}