#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

bool is_312_pattern_free(const vector<int>& perm) {
    int N = perm.size();

    vector<int> left_smaller;
    vector<int> right_larger;

    bool right = false, left = false;

    right_larger = perm;
    sort(right_larger.begin(), right_larger.end(), std::greater<int>());

    for (int i = 0; i < N-1; ++i) {
        int current = perm[i];

        auto it = find(right_larger.begin(), right_larger.end(), current);
        right_larger.erase(it);

        int L = 0, R = 0;
        for (int smaller : left_smaller) {
            if (smaller > current) {
                left = true;
                L = smaller;
            }
        }
        for(int larger : right_larger) {
            if(larger > current){
                right = true;
                R = larger;
            }
        }
        if(left && right && L>R){
            return false;
        }else{
            right = false;
            left = false;
        }

        left_smaller.push_back(current);

        sort(left_smaller.begin(), left_smaller.end());
    }

    return true;
}

int main() {
    int n;
    cin >> n;
    vector<int> perm(n);
    for(int i=0; i<n; i++){
        cin >> perm[i];
    }
    next_permutation(perm.begin(), perm.end());
    while(!is_312_pattern_free(perm)){
        next_permutation(perm.begin(), perm.end());
    }
    for(int i=0; i<n; i++){
        cout << perm[i] << " ";
    }

    return 0;
}