#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
int n, m;
int buffer[50];
void printLotto(int queueSize, vector<int> candidate, int size){
if (queueSize == 6){
// print
for (auto i=0; i<6; i++){
cout << buffer[candidate[i]] << ' ';
}
cout << '\n';
candidate.pop_back();
return;
}
if (candidate.empty()){
for (auto i=0; i<size; i++){
candidate.push_back(i);
printLotto(1, candidate,size);
candidate.pop_back();
}
return;
}
int lastIndex = candidate[candidate.size()-1];
for (auto i= lastIndex +1; i<size; i++){
candidate.push_back(i);
printLotto(queueSize+1, candidate,size);
candidate.pop_back();
}
}
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int k;
while(true){
cin >> k;
if (k == 0){
break;
}
for (auto i=0; i<k;i++){
cin >> buffer[i];
}
vector<int> candidate;
printLotto(0, candidate, k);
cout << '\n';
}
return 0;
}