
import os

def a__       (			):






  '''simple docstring'''





  with open(os.path.dirname(A__   ) + """/p022_names.txt"""   ) as file:
    __magic_name__								=			str(file.readlines()[0]   )
    __magic_name__								=			names.replace("""\"""",	""""""   ).split(""","""   )

  names.sort()

  __magic_name__								=			0
  __magic_name__								=			0

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

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


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




from __future__ import annotations





def 	__a     (      A__			:  list[int | str]       ):
    create_state_space_tree(A__			,  []			,  0			,  [0 for i in range(len(A__       )       )]       )





def 	__a     (      A__			:  list[int | str]			,  A__			:  list[int | str]			,  A__			:  int			,  A__			:  list[int]			,  ):

    if index == len(A__       ):
        print(A__       )
        return

    for i in range(len(A__       )       ):
        if not index_used[i]:
            current_sequence.append(sequence[i]       )
            SCREAMING_SNAKE_CASE										=   True
            create_state_space_tree(A__			,  A__			,  index + 1			,  A__       )
            current_sequence.pop()
            SCREAMING_SNAKE_CASE										=   False
__A			:					list[int | str]						=			[3, 1, 2, 4]
generate_all_permutations(sequence)

__A			:					list[int | str]						=			["A", "B", "C"]





generate_all_permutations(sequence_a)