def solution(left, right):
    new_list = [] # 굳이 list에 담지 않아도 된다
    for i in range(left, right + 1):
        num_list = []
        
        for j in range(1, i + 1):
            if i % j == 0:
                num_list.append(j)
        
        if len(num_list) % 2 == 0:
            new_list.append(i)
        else:
            new_list.append(-i)
    
    return sum(new_list)

solution(24, 27)

def solution(left, right):
    answer = 0
    new_list = []
    for i in range(left, right + 1):
        num_count = 0 
        
        for j in range(1, i + 1):
            if i % j == 0:
                num_count += 1
        
        if num_count % 2 == 0:
            answer += i
        else:
            answer -= i
    
    return answer

solution(24, 27)