

def        __lowerCAmelCase    (       _UpperCamelCase		:  str		,							_UpperCamelCase		:  str	)		->							list:
 '''simple docstring'''


 SCREAMING_SNAKE_CASE								=			len(_UpperCamelCase	)
 SCREAMING_SNAKE_CASE								=			[]
 for i in range(len(_UpperCamelCase	) - pat_len + 1	):
  SCREAMING_SNAKE_CASE								=			True
  for j in range(_UpperCamelCase	):
   if s[i + j] != pattern[j]:
    SCREAMING_SNAKE_CASE								=			False
    break
  if match_found:
   position.append(_UpperCamelCase	)
 return position


if __name__ == "__main__":
      assert naive_pattern_search("ABCDEFG", "DE") == [3]
      print(naive_pattern_search("ABAAABCDBBABCDDEBCABC", "ABC"))




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)

