You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Description

Output all unique permutations of the natural numbers from $1$ to $n$, i.e., the full permutation of $n$, ensuring that no duplicate digits appear in any generated sequence.

Input Format

An integer $n$ ($1≤n≤9$).

Output Format

All unique sequences of digits from $1$ to $n$, with one sequence per line. Each digit should be padded to a width of $5$.

Sample

3

1    2    3
1    3    2
2    1    3
2    3    1
3    1    2
3    2    1