Two firmware revision tags are given as strings of lowercase letters. A merged tag must contain both revisions as subsequences. Compute the length of the shortest possible merged string that has both a and b as subsequences (this is the length of their shortest common supersequence).
Input format
Line 1: the first tag string a.
Line 2: the second tag string b.
Output format
A single integer: the length of the shortest common supersequence of a and b.
Constraints
- 1 <= length of
a<= 40 - 1 <= length of
b<= 40 - Both strings consist of lowercase English letters only.