ADAPHOTO - Ada and Terramorphing

no tags 

Ada the Ladybug was already on two trips this year. She visited two countires: Republic of Bugongo and Democratic Republic of Bugongo. Even though those countires are completely different and far far away from each other, Ada found some similarities. Now she is looking at photos from each of those countries and examines similarities. Sadly, both of the sequences of photos are very long so she can't handle it herself.

The sequence of photos is sequence of following terrestical formations: A hill (^), a valley (v), a plain (-), a lake ~

Find the longest common contigous subsequence between the two sequences of photos.

Important note: Teramorphism is very difficult process. One can't eassily influence it so each of the terrestical formation is generated with more or less 25%.

Input

The first two and the only lines of input contigous first and second sequence of photos 1 ≤ |s1|, |s2| ≤ 106

Output

For each test-cases, print the longest common sequence.

Example Input

-~^v-
^--v

Example Output

1

Example Input 2

-~
-~v^^^^^v-

Example Output 2

2

Example Input 3

~-~-v--~^
~^--^~-v

Example Output 3

3

Example Input 4

^^^v-v^^v-v-v~v-
vv^v-^~~^v^~^vv~^^-

Example Output 4

3

Example Input 5

~~~vv~-~~vv~v-v--~-^-~^~-^^
~^~--v~-

Example Output 5

4


Added by:Morass
Date:2017-08-30
Time limit:2s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All