[백준 알고리즘] 5622번 다이얼

num = input()
 
def search_num(num):
    if num in ['A', 'B', 'C']:
        return 3
    elif num in ['D', 'E', 'F']:
        return 4
    elif num in ['G', 'H', 'I']:
        return 5
    elif num in ['J', 'K', 'L']:
        return 6
    elif num in ['M', 'N', 'O']:
        return 7
    elif num in ['P', 'Q', 'R', 'S']:
        return 8
    elif num in ['T', 'U', 'V']:
        return 9
    elif num in ['W', 'X', 'Y', 'Z']:
        return 10
 
number = 0
for i in num:
  number += search_num(i)
 
print(number)