




'''simple docstring'''







def 		snake_case_							(_a			:							int = 1_0_0_0  ):
    UpperCAmelCase     =	2**power
    UpperCAmelCase     =	str(_a  )
    UpperCAmelCase     =	list(_a  )
    UpperCAmelCase     =	0

    for i in list_num:
        sum_of_num += int(_a  )

    return sum_of_num


if __name__ == "__main__":
   A									=int(input('Enter the power of 2: ').strip())
   print('2 ^ ', power, ' = ', 2**power)
   A									=solution(power)
   print('Sum of the digits is: ', result)










'''simple docstring'''







def 		snake_case_							():
    for n in range(1					,     1_0_0_0_0_0_0  ):
        yield n * (n + 1) // 2





def 		snake_case_							(_a			:							Union[str, Any]  ):
    UpperCAmelCase     =	1
    UpperCAmelCase     =	2
    while i * i <= n:
        UpperCAmelCase     =	0
        while n % i == 0:
            n //= i
            multiplicity += 1
        divisors_count *= multiplicity + 1
        i += 1
    if n > 1:
        divisors_count *= 2
    return divisors_count





def 		snake_case_							():
    return next(i for i in triangle_number_generator() if count_divisors(_a  ) > 5_0_0  )


if __name__ == "__main__":
   print(solution())




