hw--Beauty

Describe	Give a name that consists of 26 strings, which defines the "beauty" of the string as the sum of all its letters "beauty". Each letter has a "pretty degree", ranging from 1 to 26. No two letters have the same "beauty degree". Letters Ignore case. Give multiple names to calculate the maximum possible "beauty" for each name.
Knowledge points	String
Run time limit	0M
Memory limit	0
Input	An integer n, followed by n names n A string, each representing a name
Output	Each name may be the most beautiful degree
Sample input	2 Zhangsan Lisi
Sample output	192 101

hw--Beauty