#include <bits/stdc++.h>

using namespace std;

const int N = 205;
char s[N], t[N];
int n, m;
unsigned long long dp[N][N], ans;

int main()
{
    cin >> (s + 1) >> (t + 1);
    n = strlen(s + 1);
    m = strlen(t + 1);

    for (int i = 1; i <= 100; i++)
        dp[i][0] = 200;
    for (int j = 1; j <= 100; j++)
        dp[0][j] = 200;
    int x;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            if (s[i] == t[j]) x=0;
            else x=1;

            dp[i][j] = min(dp[i - 1][j - 1]+x, min(dp[i - 1][j]+1, dp[i][j - 1]+1)) ;
        }
    }

    ans = dp[n][m];
    cout << ans;
    return 0;
}