#include <iostream>
#include <algorithm>

using namespace std;

int digits[10];
int solution_size;
int solution[16];
bool used[16];

void print() {
    for (int i = 1; i <= solution_size; i++) {
        cout << solution[i] << ' ';
    }
    cout << "\n";
};

void bkt(int pos_to_complete) {
    if (pos_to_complete == solution_size + 1) {
        print();
        return;
    }
    for (int i = 1; i <= solution_size; i++) {
        if (!used[i]) {
            solution[pos_to_complete] = digits[i];
            used[i] = true;
            bkt(pos_to_complete + 1);
            used[i] = false;
        }
    }
}

int main() {
    cin >> solution_size;
    for (int i = 1; i <= solution_size; i++) {
        cin >> digits[i];
    }
    sort(digits + 1, digits + solution_size + 1);
    bkt(1);
    return 0;
}