Problem E: Stick!

Problem E: Stick!

Time Limit: 2 Sec  Memory Limit: 256 MB
Submit: 4550  Solved: 540
[Submit][Status][Web Board]

Description

Lovely boys often play stick game. This is a two-player game, which goal is finding the longest common substring of the two players' names, and the length of it is defined as the stick level. Now, Amayama wants you help him to calculate the stick level between two boys.

Input

The input contains two string s1, s2 (1<=|s1|,|s2|<=100000), which are two lovely boys' names.


Output

A number stands the sticking level.

Sample Input

B.Tang
B.Tarjan

Sample Output

4

HINT

[Submit][Status]