PROGRAMMING:Substring
Keven now has two strings. Now he wants to find friends for these two strings. He wants to know how long the same subsequence (which can be discontinuous) can be matched at most in these two strings. Can you help him?
###Input format:
Continuous two lines, each line gives a length of not more than 1000 strings（ (no spaces in string)
###Output format:
Output the length of the longest identical substring.
###Input example:
Here is a set of inputs. For example:
```in
1ke,ven2
2nev.ek1
```
###Output example:
The corresponding output is given here. For example:
```out
three
```
###Exemplar explanation
The 'Eve' of the two strings is the same and the longest, so the answer is 3< br>
answer：If there is no answer, please comment
###Input format:
Continuous two lines, each line gives a length of not more than 1000 strings（ (no spaces in string)
###Output format:
Output the length of the longest identical substring.
###Input example:
Here is a set of inputs. For example:
```in
1ke,ven2
2nev.ek1
```
###Output example:
The corresponding output is given here. For example:
```out
three
```
###Exemplar explanation
The 'Eve' of the two strings is the same and the longest, so the answer is 3< br>
answer：If there is no answer, please comment