Permutations X10466

Write a program that, given $n$ different words $s_1, \dots, s_n$, prints all the permutations that can be made up with the words.

Input

Input consists of a number $n > 0$, followed by $s_1, \dots, s_n$.

Output

Print all the permutations that can be made up with $s_1, \dots, s_n$.

Information about the checker

You can print the solutions to this exercise in any order.