#include <iostream>
#include <algorithm>

using namespace std;
const int N = 15;
int a[N];
bool vis[N];
int n;
vector<int> res;

void dfs(int u)
{
    if(u == n)
    {
        for(auto i : res)
        {
            printf("%d ", i);
        }
        puts("");
        return ;
    }

    for(int i = 0; i < n; i ++)
    {
        if(vis[i] || (i && a[i] == a[i - 1] && !vis[i - 1]))
            continue;
        vis[i] = true;
        res.push_back(a[i]);
        dfs(u + 1);
        res.pop_back();
        vis[i] = false;
    }
}

int main()
{
    cin >> n;
    for(int i = 0; i < n; i ++) cin >> a[i];
    sort(a, a + n);
    dfs(0);
    return 0;
}