n = int(input())
nums = [i for i in range(1,n+1)]
res = []
path = []
used = [0]*n
def dfs(nums,path,used,n):
    if len(path) == n:
        print(*path)

    for i in range(n):
        if used[i]:
            continue
        used[i] = 1
        path.append(nums[i])
        dfs(nums,path,used,n)
        path.pop()
        used[i] = 0

dfs(nums,path,used,n)