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()
ls = len(s)
lt = len(t)
i=0
j=0
ans = 0
while(i!=ls and j!=lt):
	while(j!=lt and s[i]!=t[j]):
		j+=1
	if(j!=lt):
		ans+=1
		i+=1
		j+=1
print ans