import sys


n = int(sys.stdin.read())

# def dfs(nums, buff):
#     if len(buff) == n:
#         print ' '.join(map(str, buff))
#     else:
#         for i in range(len(nums)):
#             buff.append(nums[i])
#             dfs(nums[0:i] + nums[i+1:], buff)
#             buff.pop()

# dfs(range(1, n+1), [])

def dfs(status, buff):
    if len(buff) == n:
        print ' '.join(map(lambda x: str(x+1), buff))
    else:
        for i in range(n):
            if status >> i & 1 == 0:
                buff.append(i)
                dfs(status | 1 << i, buff)
                buff.pop()

dfs(0, [])