-
import java.util.*; public class Main{ public static boolean next_permutation(int[] x){ int i = x.length - 1; while(i > 0 && x[i - 1] <= x[i]) i -= 1; if(i <= 0) return false; int j = x.length - 1; while(x[j] >= x[i - 1]) j -= 1; int temp = x[i-1]; x[i-1] = x[j]; x[j] = temp;//swap(x[j], x[i-1]) j = x.length - 1; while(i < j){ temp = x[i]; x[i] = x[j]; x[j] = temp; i+= 1; j-= 1; } return true; } public static void main(String[] args){ Scanner stdIn = new Scanner(System.in); int n = 1; while(n!= 0) { n = stdIn.nextInt(); if(n == 0 ) break; int[] set = new int[n]; for (int i = 0; i < n; i++) { set[i] = stdIn.nextInt(); } int length = 6; int[] y = new int[6]; int[] x = new int[n]; for (int i = 0; i < n; i++) { x[i] = i; } Arrays.sort(set); int[] test = new int[n]; for (int i = 0; i < n; i++) { if (i >= 6) test[i] = 0; else test[i] = 1; } do { for (int i = 0; i < n; i++) { if (test[i] == 1) { System.out.print(set[i] + " "); } } System.out.println(); } while (next_permutation(test)); System.out.println(); } } }