You are given two words (each word consists of upper-case English letters). Delete some letters from each word so that the resulting words become equal.
Find the maximum possible length of the resulting word.
Each test case consists of a single line, containing two words separated by a space. The length of each of these words is between 1 and 200. There are no more than 10 test cases.
For each test case output the maximum length of a resulting word (the length of the longest word that can be created from both words by removing some letters).
If two words have no letters in common, print 0.