def solve(n: int):
    used: list[bool] = [False] * (n + 1)
    curr_sol: list[int] = []
    sol: list[list[int]] = []
    def bkt():
        if len(curr_sol) == n:
            sol.append(curr_sol[:])
            return
        
        for i in range(1, n + 1):
            if not used[i]:
                curr_sol.append(i)
                used[i] = True
                bkt()
                curr_sol.pop()
                used[i] = False
    
    bkt()
    for s in sol:
        print(*s)

def main():
    n: int = 0
    n = int(input())
    solve(n)

if __name__ == "__main__":
    main()