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
st = raw_input()
sb = raw_input()
pl = st
flag=0
ans = 0
ilen = len(pl)
j=0
k=0
while k!=len(sb):
	c = pl[j]
	d = sb[k]
	if c==d:
		j+=1
		ans+=1
		if j==ilen: 
			break
	k+=1

print ans