Length of the longest common sub-sequence

Question Description

Given two strings str1 and str2, if we get the string str after removing some characters str1, we can get the string str after removing some characters str2, we say STR is a common substring of str1 and str2. Of course, you can't change the relative order of the characters when you get str. Please write your program to find the maximum value of the string str length.

Input

Two lines, one string with an English letter in each line

Output

A number that represents the length of the longest common substring of a two string

Input example

Abcef Bmcguafb

Output example

3

Other Notes

The input string length does not exceed 1000

Dynamic planning

Note that the string default starts at 0.

Length of the longest common sub-sequence

Length of the longest common sub-sequence