lotto

#include <iostream>
#include <set>
#include <algorithm>
#include <string.h>
#include <queue>
using namespace std;
const int N = 1e5 + 5;
int arr[10005];
int ans[10005];
bool vis[10005];
int n, m;
void (int x,int cur)
{
	if(x>6)
	{
		for (int i = 1; i <= 5;i++)
		{
			cout << ans[i] << ' ';
		}
		cout << endl;
		return;
	}
	for (int i = cur; i <= m;i++)
	{
		ans[x] = arr[i];
		dfs(x + 1,i+1);
	}
}
int main()
{
	while((cin>>m),m)
	{
		for (int i = 1; i <= m;i++)
		{
			cin >> arr[i];
		}
		sort(arr + 1, arr + 1 + m);
		dfs(1,1);
	}
}