def solution(n):
arr = []
while n > 0:
arr.append(n % 10)
n //=10
return arr
def solution(n):
return list(map(int, reversed(str(n))))
def solution(n):
return [int(i) for i in str(n)][::-1]
def solution(n):
return sum(map(int,str(n)))
def solution(n):
ret =[]
for i in str(n):
ret.append(int(i))
ret.reverse()
return ret