You are given two string S and T. Find the maximal length of some prefix of the string S which occurs in strings T as subsequence.

Input
The first line contains string S.
The second line contains string T.
Both strings consist of lowecase Latin letters.

Output
Output one integer - answer to the question.

Constraints
1 ≤ length of S, T ≤ 10^6

SAMPLE INPUT
digger
biggerdiagram

SAMPLE OUTPUT
3
first = raw_input()
second = raw_input()

length=0
pos=0

while(length < len(first) and pos < len(second)):
    if (first[length] == second[pos]):
        length += 1
    pos += 1

print length