def dfs(u):
if u == n:
print(" ".join(map(str, g)))
return
for i in range(n):
if not st[i]:
st[i] = True
g[u] = i + 1
dfs(u + 1)
st[i] = False
if __name__ == "__main__":
n = int(input())
st = [False] * n
g = [0] * n
dfs(0)