A string w is a common supersequence of s and t if both s and t are subsequences of w (each obtainable by deleting some characters of w). Find the length of the shortest common supersequence of s and t.
Input format
Line 1: the string s (possibly empty).
Line 2: the string t (possibly empty).
Both strings contain only lowercase letters a-z.
Output format
A single integer: the length of the shortest common supersequence.
Constraints
- 0 <= length of each string <= 1000