3

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

n = int(input())
result = []
def permute(path, used):
    if len(path) == n:
        result.append(path[:])
        return
    for i in range(1, n+1):
        if not used[i]:
            used[i] = True
            path.append(i)
            permute(path, used)
            path.pop()
            used[i] = False
used = [False] * (n+1)
permute([], used)
for p in result:
    print(*p)