#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 20;
int n;
int d[N];
void calc(int x, vector<int>& result) {
    for (int i = 0; i < result.size(); i++) {
        printf("%d ", result[i]);
    }
    puts("");


    for (int i = x; i < n; i++) {
        if (i != x && d[i] == d[i-1]) continue;
        result.push_back(d[i]);
        calc(i+1, result);
        result.pop_back();
    }

}

int main() {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> d[i];
    sort(d, d+n);
    vector<int> result;
    calc(0, result);
}