A little known fact about cows is that they have their own version of the alphabet, the \textbf{"cowphabet"}. It consists of the $26$ letters '$a$' through '$z$', but when a cow speaks the cowphabet, she lists these letters in a specific ordering that might be different from the order \textbf{"abcdefghijklmnopqrstuvwxyz"} we are used to hearing. To pass the time, Bessie the cow has been humming the cowphabet over and over again, and Farmer John is curious how many times she's hummed it. Given a lowercase string of letters that Farmer John has heard Bessie say, compute the minimum number of times Bessie must have hummed the entire cowphabet in order for Farmer John to have heard the given string. Farmer John isn't always paying attention to what Bessie hums, and so he might have missed some of the letters that Bessie has hummed. The string you are told consists of just the letters that he remembers hearing. \InputFile The first line contains the $26$ lowercase letters '$a$' through '$z$' in the order they appear in the \textbf{"cowphabet"}. The next line contains the string of lowercase letters that Farmer John heard Bessie say. This string has length at least $1$ and at most $1000$. \OutputFile Print the minimum number of times Bessie must have hummed the entire cowphabet. \Examples In this example, the cowphabet is ordered the same as the normal alphabet. Bessie must have hummed the cowphabet at least three times. It is possible for Bessie to have only hummed the cowphabet three times, and for Farmer John to have heard the letters in uppercase as denoted below. \begin{lstlisting} abcdefghijklMnOpqrstuvwxyz abcdefghijklmnOpqrstuvwxyz abcDefghijklmnopqrstuvwxyz \end{lstlisting}