A. Swapped Signs
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

It is the day of the Iditarod Trail Sled Dog Race, and you are excited to participate!

As you line up for the race, you notice that a word posted on the letter board outside looks slightly off. For example, the board may say, "COME FOR THE SHIRTS!" instead of "COME FOR THE SPORTS!". Dismayed, you decide to fix the board minutes before the race begins by swapping out the word $$$s$$$ (in this case, "SHIRTS") with the intended word $$$t$$$ (in this case, "SPORTS"). Fortunately, there is a box placed next to the foot of the sign filled with spare, unused letters. However, you see no X's or B's in the box or on the board, so will have to tack together two I's and P's respectively when it comes to making these characters. You are in a hurry, and want to calculate the minimum number of letters you need to put on the board to make it correct again.

Input

The first line contains an uppercase strings $$$s \: (0 \leq |s|\leq 10^5)$$$, the initial word on the board.

The second line contains an uppercase string $$$t \: (0 \leq |t|\leq 10^5)$$$, the end word you wish to transform $$$s$$$ into.

Output

Please output a single integer $$$k$$$, the minimum number of letters you should put on the board to fix the message.

Examples
Input
SHIRTS
SPORTS
Output
2
Input
PATHS
PATHS
Output
0
Note

You can assume that the box of unused letters will not run out of any character during the duration of your swapping.