s= input()
t=input()
w=0
while True:
i = len(s) - w - 1
j = len(t)-w-1
if i>=0 and j>=0 and t[j]==s[i]:
w += 1
else:
break
print(len(s)+len(t)-2*w)#include<iostream>
#include<queue>
#include<stack>
#include<deque>
#include<algorithm>
#include<vector>
#include<cmath>
#include<string>
#include<iomanip>
#include<map>
#include<set>
#include<bitset>
#define ll long long
#define T int t; cin>>t; while(t--)
#define pb push_back
#define vv vector
#define ss string
#define so(vec) sort(vec.begin(), vec.end())
#define srt(vec) sort(vec.rbegin(), vec.rend())
#define s(s) sort(s.begin(), s.end())
#define all(vec) vec.begin(), vec.end()
#define sor(arr,n) sort(arr, arr+n)
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define Mod 1000000007
const double PI = 3.14159265358979323846;
using namespace std;
void HaiDO0da() {
ios_base::sync_with_stdio(false);
cout.tie(NULL);
cin.tie(NULL);
}
int main()
{
HaiDO0da();
ss x,y; cin>>x >>y;
int cnt=0,b=x.size()+y.size(),c=min(x.size(),y.size());
reverse(x.begin(),x.end());
reverse(y.begin(),y.end());
for(int i=0;i<c;i++){
if(x[i]==y[i]) cnt++;
else break;
}
//cout<<cnt;
cout<<b-(cnt*2);
}
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |
1295. Find Numbers with Even Number of Digits | 1704. Determine if String Halves Are Alike |
1732. Find the Highest Altitude | 709. To Lower Case |
1688. Count of Matches in Tournament | 1684. Count the Number of Consistent Strings |
1588. Sum of All Odd Length Subarrays | 1662. Check If Two String Arrays are Equivalent |
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |
672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |