’‘’ def dfs(u,n,buff): if(u>n): print(‘ ‘.join(map(str,buff))) else: dfs(u+1,n,buff) buff.append(u) dfs(u+1,n,buff) buff.pop() n=int(input()) dfs(1,n,[]) ‘’‘