#905. Longest common subsequence
You get two strings. Find the length of their longest common subsequence (LCS).
### Input
Two lines.
### Output
A number.
Examples
Input
bc ababb
Output
1
Input
ab cc
Output
0
💡 You can solve it with Python, JavaScript or blocks. Read the input line by line with input(). Don't print a question (like input("Number: ")). Print exactly what the output asks for, nothing more.