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
# AOJ ITP2_5_D: Permutation Enumeration
# Python3 2018.6.24 bal4u

def next_permutation(a):
    i = len(a)-2
    while i >= 0 and a[i] >= a[i+1]: i -= 1
    if i < 0: return False
    j = i + 1
    k = len(a) - 1
    while a[i] >= a[k]: k -= 1
    a[i], a[k] = a[k], a[i]
    a[j:] = a[:j-1:-1]
    return True

n = int(input())
if n == 1: print(1)
else:
	a = [i for i in range(1, n+1)]
	print(*a)
	while next_permutation(a): print(*a)
