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

void Print(const std::vector<int> &values) {
    for (size_t i = 1; i < values.size(); i++) {
        std::cout << values[i] << " ";
    }
    std::cout << '\n';
}

int main() {
    int n;
    std::cin >> n;
    std::vector<int> v(n + 1);
    for (int i = 0; i < n; i++) {
        std::cin >> v[i + 1];
    }

    std::sort(v.begin(), v.end());
    Print(v);

    while (true) {
        int j = n;
        while (v[j] <= v[j - 1]) {
            j--;
        }
        j--;

        if (j == 0) {
            break;
        }
        for (int i = n; i > j; i--) {
            if (v[i] > v[j]) {
                std::swap(v[i], v[j]);
                break;
            }
        }

        for (int i = n; i > j + (n - j) / 2; i--) {
            std::swap(v[i], v[j + n - i + 1]);
        }

        Print(v);
    }
}