Problem Statement:
Given two string S and T. You can delete a character from S with cost 15 or a Character from T with cost 30. Your goal is to make the string equal (same). It is not mandatory to delete character.

For example : S = aXb and T = Yab, Now, if we delete X from S and Y from T, then total cost = 15+30 = 45. And S and T will become ab.

Another example : S = ab, T = cd, Now total cost = 15 + 15 + 30 + 30 = 90.

Another example : S = abcd, T = acdb, Now total cost = 15 + 30 = 45.


Input Format:
Input consists of pairs of lines. The first line of a pair contains the first string S and the second line contains the second string T. Each string is on a separate line and consists of at most 1000 characters. The end of input occurs when the first sequence starts with an "#"character (without the quotes).


Output Format:
For each subsequent pair of input lines, output a line containing one integer number which the minimum cost to make the string equal (same).


Sample Input:
axb yab ab cd ko p abcd acdb #


Sample Output:
45 90 60 45





Added by: shipu
Added at: 2014-07-24 18:51:16 UTC
Time Limit: 1 second
Partial score: No
Source:Shipu Ahamed, Dept. of CSE, Bangladesh University of Business and Technology (BUBT)