#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 10, INF = 0x3f3f3f3f, MOD = 1E9 + 7;
int n, a[N], nums[N];
bool st[N];
void dfs(int u) {
    if (u > n) {
        for (int i = 1; i <= n; i++)
            cout << nums[a[i]] << " ";
        cout << endl;
        return;
    }
    for (int i = 1; i <= n; i++) {
        if (!st[i]) {
            a[u] = i, st[i] = 1, dfs(u + 1);
            st[i] = 0;
        }
    }
}

int main(int argc, char* argv[]) {
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> nums[i];
    sort(nums + 1, nums + 1 + n);
    dfs(1);
    return 0;
}