A palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left.
Given two strings which consists of lowercase letters, find the length of the longest common palindrome substring among these strings.
There are several test cases.
For each test case, there are two single lines contains two string S and T which only consist of lowercase English letters. (1≤|S|,|T|≤105)
For each test case, output the length in a single line.