https://programmers.co.kr/learn/courses/30/lessons/12980
def solution(n): count = 0 while n > 0: # 홀수 if n % 2: n -= 1 count += 1 # 짝수 else: n = n // 2 return count