B. Two Screens
time limit per test
2 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output

There are two screens which can display sequences of uppercase Latin letters. Initially, both screens display nothing.

In one second, you can do one of the following two actions:

  • choose a screen and an uppercase Latin letter, and append that letter to the end of the sequence displayed on that screen;
  • choose a screen and copy the sequence from it to the other screen, overwriting the sequence that was displayed on the other screen.

You have to calculate the minimum number of seconds you have to spend so that the first screen displays the sequence $$$s$$$, and the second screen displays the sequence $$$t$$$.

Input

The first line contains the string $$$s$$$, and the second line contains the string $$$t$$$ ($$$1 \le |s|, |t| \le 100$$$). Both strings consist of uppercase Latin letters.

Output

Print one integer — the minimum possible number of seconds you have to spend so that the first screen displays the sequence $$$s$$$, and the second screen displays the sequence $$$t$$$.

Examples
Input
GARAGE
GARAGEFORSALE
Output
14
Input
ABCDE
AABCD
Output
10
Note

In the first test case, the following sequence of actions is possible:

  • spend $$$6$$$ seconds to write the sequence GARAGE on the first screen;
  • copy the sequence from the first screen to the second screen;
  • spend $$$7$$$ seconds to complete the sequence on the second screen by writing FORSALE.

In the second test case, the following sequence of actions is possible:

  • spend $$$1$$$ second to write the sequence A on the second screen;
  • copy the sequence from the second screen to the first screen;
  • spend $$$4$$$ seconds to complete the sequence on the first screen by writing BCDE;
  • spend $$$4$$$ seconds to complete the sequence on the second screen by writing ABCD.