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()
total = 0;
i = 0;
for c in t:
	if c==s[i]:
		i+=1
		total+=1
		if i==len(s): break
print total