'''simple docstring'''




import os






def __lowerCAmelCase					(				)      ->       int:
    with open(os.path.dirname(UpperCamelCase__							) + '''/p022_names.txt'''							) as file:
        __lowerCamelCase            =    str(file.readlines()[0]							)
        __lowerCamelCase            =    names.replace('''"'''							,    ''''''							).split(''','''							)

    names.sort()

    __lowerCamelCase            =    0
    __lowerCamelCase            =    0

    for i, name in enumerate(UpperCamelCase__							):
        for letter in name:
            name_score += ord(UpperCamelCase__							) - 64

        total_score += (i + 1) * name_score
        __lowerCamelCase            =    0
    return total_score


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

'''simple docstring'''




def __lowerCAmelCase					(				UpperCamelCase__							,    UpperCamelCase__							)      ->       float:
    return base * power(UpperCamelCase__							,    (exponent - 1)							) if exponent else 1


if __name__ == "__main__":
  print("Raise base to the power of exponent using recursion...")
  __UpperCAmelCase					=int(input("Enter the base: ").strip())
  __UpperCAmelCase					=int(input("Enter the exponent: ").strip())
  __UpperCAmelCase					=power(base, abs(exponent))
  if exponent < 0:  # power() does not properly deal w/ negative exponents
    __UpperCAmelCase					=1 / result
  print(f'{base} to the power of {exponent} is {result}')
