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
n = int(input())
nl = [str(i) for i in range(1, n+1)]
def perm(nl):

    if len(nl) == 0:
        return []

    if len(nl) == 1:
        return [nl]

    l = []

    for i in range(len(nl)):

        m = nl[i]

        rest = nl[:i] + nl[i+1:]

        for p in perm(rest):
            l.append([m] + p)


    return l



for i in perm(nl):
    print(" ".join(i))
