

import math


def        __lowerCAmelCase    (       _UpperCamelCase		:  int	)		->							bool:
 '''simple docstring'''


 SCREAMING_SNAKE_CASE								=			math.loga(math.sqrt(4 * positive_integer + 1	) / 2 + 1 / 2	)

 return exponent == int(_UpperCamelCase	)


def        __lowerCAmelCase    (       _UpperCamelCase		:  float = 1 / 1_23_45	)		->							int:
 '''simple docstring'''


 SCREAMING_SNAKE_CASE								=			0
 SCREAMING_SNAKE_CASE								=			0

 SCREAMING_SNAKE_CASE								=			3
 while True:
  SCREAMING_SNAKE_CASE								=			(integer**2 - 1) / 4
  # if candidate is an integer, then there is a partition for k
  if partition_candidate == int(_UpperCamelCase	):
   SCREAMING_SNAKE_CASE								=			int(_UpperCamelCase	)
   total_partitions += 1
   if check_partition_perfect(_UpperCamelCase	):
    perfect_partitions += 1
  if perfect_partitions > 0:
   if perfect_partitions / total_partitions < max_proportion:
    return int(_UpperCamelCase	)
  integer += 1


if __name__ == "__main__":
      print(F"""{solution() = }""")




def        __lowerCAmelCase    (       _UpperCamelCase		:  int = 10_00	)		->							int:
 '''simple docstring'''


 SCREAMING_SNAKE_CASE								=			2**power
 SCREAMING_SNAKE_CASE								=			str(_UpperCamelCase	)
 SCREAMING_SNAKE_CASE								=			list(_UpperCamelCase	)
 SCREAMING_SNAKE_CASE								=			0

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

 return sum_of_num


if __name__ == "__main__":
      a_    :						List[str]    		=      int(input("Enter the power of 2: ").strip())
      print("2 ^ ", power, " = ", 2**power)
      a_    :						int    		=      solution(power)
      print("Sum of the digits is: ", result)

