Delete from the Left

题目：

You are given two strings ss and tt. In a single move, you can choose any of two strings and delete the first (that is, the leftmost) character. After a move, the length of the string decreases by 11. You can't choose a string if it is empty.

For example:

• by applying a move to the string "where", the result is the string "here",
• by applying a move to the string "a", the result is an empty string "".

You are required to make two given strings equal using the fewest number of moves. It is possible that, in the end, both strings will be equal to the empty string, and so, are equal to each other. In this case, the answer is obviously the sum of the lengths of the initial strings.

Write a program that finds the minimum number of moves to make two given strings ss and tt equal.

Input

The first line of the input contains ss. In the second line of the input contains tt. Both strings consist only of lowercase Latin letters. The number of letters in each string is between 1 and 2⋅1052⋅105, inclusive.

Output

Output the fewest number of moves required. It is possible that, in the end, both strings will be equal to the empty string, and so, are equal to each other. In this case, the answer is obviously the sum of the lengths of the given strings.

Examples

Input

test
west

Output

2

Input

codeforces
yes

Output

9

Input

test
yes

Output

7

Input

b
ab

Output

1

Note

In the first example, you should apply the move once to the first string and apply the move once to the second string. As a result, both strings will be equal to "est".

In the second example, the move should be applied to the string "codeforces" 88 times. As a result, the string becomes "codeforces" →→ "es". The move should be applied to the string "yes" once. The result is the same string "yes" →→ "es".

In the third example, you can make the strings equal only by completely deleting them. That is, in the end, both strings will be empty.

In the fourth example, the first character of the second string should be deleted.

题目分析：

给定两个字符串，统计两个字符串相等的序列长度，注意这里不是指两个字符串中的某一段位置字符相同，而是两个字符串分别从某一位置开始，往后的元素均相同。

所以这里可以对两个字符串从后往前进行比较，直到不相等的地方结束。而这里统计的数值是，两段中除去相等的字符序列还有多少个字符。

代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stack>
#include<iostream>
#include<queue>
using namespace std;
int main()
{
    char a[200001],b[200001];
    scanf("%s",a);
    scanf("%s",b);
    int len1=strlen(a);
    int len2=strlen(b);
    int len=len1+len2;
    for(int i=len1-1,j=len2-1;i>=0,j>=0;i--,j--)
    {
        if(a[i]==b[j])
          len-=2;
        else break;
    }
    cout<<len<<endl;
    return 0;
}

代码二：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stack>
#include<iostream>
#include<queue>
using namespace std;
int main()
{
    char a[200001],b[200001];
    scanf("%s",a);
    scanf("%s",b);
    int len1=strlen(a);
    int len2=strlen(b);
    while(len1&&len2&&a[len1-1]==b[len2-1])
    {
        len1--;
        len2--;
    }
    cout<<len1+len2<<endl;
    return 0;
}