e-olymp
Competitions

ADA University - February 9

All permutations of given length

Given number n. Print all permutations of numbers from 1 to n in lexicographical order.

Input

One number n (0 < n < 10).

Output

Print all permutations of numbers from 1 to n in lexicographical order. Print each permutation in a separate line. Do not print spaces between numbers in one line.

Time limit 1 second
Memory limit 128 MiB
Input example #1
3
Output example #1
123
132
213
231
312
321