For given an integer $n$, print all permutations of $\\{1, 2, ..., n\\}$ in lexicographic order.

Constraints

* $1 \leq n \leq 9$

Input

An integer $n$ is given in a line.

Output

Print each permutation in a line in order. Separate adjacency elements by a space character.

Examples

Input

2


Output

1 2
2 1


Input

3


Output

1 2 3
1 3 2
2 1 3
2 3 1
3 1 2
3 2 1
import itertools


if __name__ == "__main__":
    n = int(input())
    nums = [num for num in range(1, n + 1)]
    nums_permutated = list(itertools.permutations(nums))

    for elem in nums_permutated:
        print(" ".join([str(num) for num in elem]))

