'''simple docstring'''





def     __lowerCAmelCase						(       a_       ,      a_       ,      a_       ,      a_       ,      a_		)      ->	str:





     '''simple docstring'''





     if index == number_of_items:
          return 0
     SCREAMING_SNAKE_CASE					:			Optional[int]    	=       0
     SCREAMING_SNAKE_CASE					:			str    	=       0
     SCREAMING_SNAKE_CASE					:			List[Any]    	=       knapsack(__A       ,      __A       ,      __A       ,      __A       ,      index + 1		)
     if weights[index] <= max_weight:
          SCREAMING_SNAKE_CASE					:			Optional[int]    	=       values[index] + knapsack(
              __A       ,      __A       ,      __A       ,      max_weight - weights[index]       ,      index + 1		)
     return max(__A       ,      __A		)


if __name__ == "__main__":
 import doctest

 doctest.testmod()

'''simple docstring'''





def     __lowerCAmelCase						(       a_ = 1000		)      ->	int:





     '''simple docstring'''





     SCREAMING_SNAKE_CASE					:			Union[str, Any]    	=       2**power
     SCREAMING_SNAKE_CASE					:			Any    	=       str(a_		)
     SCREAMING_SNAKE_CASE					:			int    	=       list(a_		)
     SCREAMING_SNAKE_CASE					:			Any    	=       0

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

     return sum_of_num


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



