Two bookkeeping ledgers are stored as strings of lowercase letters. In one cleanup step you may delete a single character from either string. Find the minimum total number of deletions needed to make the two strings identical.
Input format
Line 1: the first ledger string a.
Line 2: the second ledger string b.
Output format
A single integer: the minimum number of deletions required.
Constraints
- 1 <= length of
a<= 40 - 1 <= length of
b<= 40 - Both strings consist of lowercase English letters only.