Two notes are stored as strings of lowercase letters. Each letter has a weight equal to its position in the alphabet: a = 1, b = 2, ..., z = 26. You may delete characters from either string; deleting a character costs its weight. Find the minimum total weight of deleted characters needed to make the two strings equal.
Input format
Line 1: the first note string a.
Line 2: the second note string b.
Output format
A single integer: the minimum total weight of deleted characters.
Constraints
- 1 <= length of
a<= 40 - 1 <= length of
b<= 40 - Both strings consist of lowercase English letters only.