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
S=raw_input()
T=raw_input()

count=0
lent=len(S)
for i in T:
    if(i==S[count]):
        count=count+1
    if(count==lent):
        break

print(count)