Java programming challenge

make sure you follow the output ...

Given a string s, little Johnny defined the beauty of the string as the sum of the beauty of the letters in it. The beauty of each letter is an integer between 1 and 26, inclusive, and no two letters have the same beauty. Johnny doesn't care about whether letters are uppercase or lowercase, so that doesn't affect the beauty of a letter. (Uppercase 'F' is exactly as beautiful as lowercase 'f', for example.) You're a student writing a report on the youth of this famous hacker. You found the string that Johnny considered most beautiful. What is the maximum possible beauty of this string? Input:

Your program should read lines from standard input. Each line is a string.

Output:

Print out the maximum beauty for the string.

Test 1

Test Input

Download Test Input

ABbCcc

Expected Output

Download Test Output

152

Test 2

Test Input

Download Test Input

Ignore punctuation, please :)

Expected Output

Download Test Output

491