#include <iostream>
#include <cmath>
#include <vector>


using namespace std;


int main(){
    int n;
    cin >> n;
    vector<int> v(n);

    for (int i = 0; i < n; i++)
        cin >> v[i];

    int max = v[0];
    int max_ind = 0;
    int min  = v[0];
    int min_ind = 0;
    for (int i = 0; i < n; i++){
        if (max<v[i]){
            max = v[i];
            max_ind = i;
        }
        if (v[i] < min){
            min = v[i];
            min_ind = i;
        }
    }

    v.push_back(1000);

    for (int i = v.size() - 1; i > max_ind; i--)
        v[i] = v[i-1];

    v[max_ind+1] = 0;

    if (min_ind > max_ind)
        min_ind++;


    v.push_back(0);
    for (int i = v.size() - 1; i >= min_ind ; i--)
        v[i] = v[i-1];

    v[min_ind] = 0;

    for (auto elem:v)
        cout << elem << " ";

    return 0;
}