#include <bits/stdc++.h>
using namespace std;




signed main() {
    cin.tie(0)->sync_with_stdio(0);
	string a, b;
    cin >> a >> b;
    int n = a.size(), m = b.size();
    a = "0" + a; // such that the index of a and b start from 1
    b = "0" + b;
    // dp[i][j] : number of steps required to transform b[1:i] onto a[1:j]
    vector<vector<int>> dp(m + 1, vector<int> (n + 1, 0));
    
    for (int i = 1; i <= n; i++) {
        dp[0][i] = i;
    }
    for (int i = 1; i <= m; i++) {
        dp[i][0] = i;
    }
    
    for (int i = 1; i <= m; i++) {
        for (int j = 1; j <= n; j++) {
            // delete b[i]
            dp[i][j] = dp[i - 1][j] + 1;
            
for (int k = min(i, j); k >= 1; k--) {
                if (b[i] == a[k]) {
                    // when dp[i - 1][k - 1] == 0
                    // a[1:k] == b[1:k], no need to move the cursor
                    dp[i][j] = min(dp[i][j], 
                                dp[i - 1][k - 1] + (dp[i - 1][k - 1] == 0 ? 0 : 2) + j - k);
                }
            }
            // mn[alpha][x][y] := 
            // min{y <= x, a[y + 1] == alpha} dp[x][y] + (dp[x][y] == 0 ? 0 : 2) - y - 1;
            // k = min(dp[i][j], mn[b[i]][i - 1][min(i, j) - 1] + j);
        }
    }
    cout << dp[m][n] << endl;


	return 0;
}