说明

Find a longest common subsequence of two strings.

输入格式

First and second line of each input case contain two strings of lowercase character a…z. There are no spaces before, inside or after the strings. Lengths of strings do not exceed 100.

输出格式

For each case, output k – the length of a longest common subsequence in one line.

样例

google
goodbye

4