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
def find(s,t):
	l=0
	p=0
	while l<len(s) and p<len(t):
		if s[l] == t[p]:
			l+=1;
		p+=1
	return l
if __name__ == '__main__':
	s=raw_input()
	t=raw_input()
	print find(s,t)