Permutations X10466

Statement

html

Write a program that, given n different words s₁, …, 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₁, …, s_n.

Output

Print all the permutations that can be made up with s₁, …, s_n.

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

Public test cases

Input

3
hola adeu hi

Output

(hola,adeu,hi)
(hola,hi,adeu)
(adeu,hola,hi)
(adeu,hi,hola)
(hi,hola,adeu)
(hi,adeu,hola)

Information