//

 //by coolxxx

 ////<bits/stdc++.h>

 #include<iostream>

 #include<algorithm>

 #include<string>

 #include<iomanip>

 #include<map>

 #include<memory.h>

 #include<time.h>

 #include<stdio.h>

 #include<stdlib.h>

 #include<string.h>

 //#include<stdbool.h>

 #include<math.h>

 #define min(a,b) ((a)<(b)?(a):(b))

 #define max(a,b) ((a)>(b)?(a):(b))

 #define abs(a) ((a)>0?(a):(-(a)))

 #define lowbit(a) (a&(-a))

 #define sqr(a) ((a)*(a))

 #define swap(a,b) ((a)^=(b),(b)^=(a),(a)^=(b))

 #define mem(a,b) memset(a,b,sizeof(a))

 #define eps (1e-8)

 #define J 10

 #define MAX 0x7f7f7f7f

 #define PI 3.14159265358979323

 #define N 104

 using namespace std;

 typedef long long LL;

 int cas,cass;

 int n,m,lll,ans;

 char s1[N],s2[N];

 int f[N][N];

 int main()

 {

     #ifndef ONLINE_JUDGE

     freopen("1.txt","r",stdin);

 //    freopen("2.txt","w",stdout);

     #endif

     int i,j;

 //    for(scanf("%d",&cas);cas;cas--)

 //    for(scanf("%d",&cas),cass=1;cass<=cas;cass++)

     while(~scanf("%s%s",s1,s2))

 //    while(~scanf("%d",&n))

     {

         n=strlen(s1);m=strlen(s2);

         mem(f,);

         for(i=;i<=n;i++)

         {

             for(j=;j<=m;j++)

             {

                 f[i][j]=max(f[i-][j],f[i][j-]);

                 if(s1[i-]==s2[j-])f[i][j]=max(f[i][j],f[i-][j-]+);

             }

         }

         printf("%d\n",n+m-f[n][m]);

     }

     return ;

 }

 /*

 //

 //

 */