#include <algorithm>
#include <string>
#include <iostream>
using namespace std;
 
int main()
{
    unsigned k,num[13];
    unsigned i;
    bool flag,flag2=false;
 
    while (cin>>k,k)
    {
        if (flag2) cout<<endl;
        else flag2=true;
        for (i=0;i<k;i++) cin>>num[i];
        string s("111111");
        s.insert(s.end(),k-6,’0′);
 
        do
        {
            flag=false;
            for (i=0;i<s.size();i++)
            {
                if (s[i]==’1′)
                {
                    if (flag) cout<<" ";
                    else flag=true;
                    cout<<num[i];
                }
            }
            cout<<endl;
        }
        while (prev_permutation(s.begin(),s.end()));
    }
 
    return 0;
}

#include <stdio.h>
 
int a[20], b[10];
 
void Perm(int top, int n)
{
    if (top >= 6)
    {
        printf("%d", b[0]);
        for (int i = 1; i < 6; ++ i) printf(" %d", b[i]);
        putchar(’\n’);
        return;
    }
 
    for (int j = top; j < n; ++ j)
    {
        if (!top || a[j] > b[top - 1])
        {
            b[top ++] = a[j];
            Perm(top, n);
            – top;
        }
    }
}
 
int main()
{
    int n, i, t = 0;
 
    while ( scanf("%d", &n) == 1 && n )
    {
        for (i = 0; i < n; ++ i)     scanf("%d", &a[i]);
        if (t ++ > 0)    putchar(’\n’);
        Perm(0, n);
    }
 
    return 0;
}