/*   @JUDGE_ID:   1705PZ   441   C */
#include <stdio.h>

int p[6];

int shift(int x,int k){
	int i;
	if(p[x] < k - 6 + x){
		for(i = 5;i >= x;i--)
			p[i] = p[x] + i - x + 1;
		}
	else{
		if(p[0] == k - 6)
			return 0;
		else
			shift(x - 1,k);
		}
	return 1;
	}

int main(){
int i,k;
int data[13];
while(1){
	for(i = 0;i < 6;i++)
		p[i] = i;
	scanf("%d",&k);
	if(k == 0)
		break;
	for(i = 0;i < k;i++)
		scanf("%d",&data[i]);
	while(1){
		for(i = 0;i < 6;i++)
			printf("%d ",data[p[i]]);
		printf("\n");
		if(shift(5,k) == 0)
			break;
		}
	printf("\n");
	}
return 0;
}
@END_OF_SOURCE_CODE