Anagrams

Elly has two strings $A$ and $B$ of the same length. She wants to change some of the letters of $A$ so that $A$ becomes an anagram of $B$.

Two strings $X$ and $Y$ are anagrams of each other when the letters of one of them can be rearranged into the other.

The only operation Elly can make is to cyclically increment one or more times some (possibly none or all) of the characters in $A$. 'A' becomes 'B', 'K' becomes 'L', and 'Z' becomes 'A' again.

For example, turning "ELLY" into "KRIS" position by position costs 6 operations from 'E' to 'K', 6 more from 'L' to 'R', 23 from the second 'L' to 'I' (the 15th operation goes from 'Z' to 'A'), and 20 from 'Y' to 'S' (the 2nd operation goes from 'Z' to 'A'). The total is $6 + 6 + 23 + 20 = 55$ operations. Making "ELLY" an anagram of "KRIS" is cheaper: changing it to "IRSK" costs only 29 operations.

You are given the strings $A$ and $B$. Compute the minimum number of operations needed to turn $A$ into a string $X$ that is an anagram of $B$.

The first line holds the string $A$ and the second line holds the string $B$. Both strings contain only uppercase letters of the English alphabet ('A' to 'Z').

Print one integer, the minimum number of increments.

• $1 \le |A| = |B| \le 50$ ($|S|$ is the length of the string $S$)