Write program that prints all the permutations of { 1, …, n }
for a given n.
Input
Input consists of a natural number n > 0.
Output
Print all the permutations of { 1, …, n }
in lexicographical order.
About statements
The official statement of a problem is always the one
in the PDF document. The HTML version of the statement
is also given to help you, but may contain some content
that is not well displayed. In case of doubt, always use the PDF.