#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<iostream>

#include<queue>

using namespace std;

const int maxn=;

char s[maxn],t[maxn];

int lens,lent;

int dp[maxn][maxn];

int main()

{

    memset(s,,sizeof s);

    memset(t,,sizeof t);

    scanf("%s%s",s,t);

    lens=strlen(s), lent=strlen(t);

    for(int i=lens;i<lens+lent;i++) s[i]='.';

    lens=strlen(s);

    int ans=;

    for(int Len=;Len<=lent;Len++)

    {

        for(int i=;i<lens;i++)

        {

            int j=i+Len-;

            if(j>=lens) continue;

            if(j==i)

            {

                if(s[i]==t[lent-]) dp[i][j]=;

                else dp[i][j]=;

                ans=min(ans,j-i+-dp[i][j]+lent-(j-i+));

            }

            else

            {

                dp[i][j]=dp[i+][j];

                if(s[i]==t[lent-+i-j]) dp[i][j]++;

                ans=min(ans,j-i+-dp[i][j]+lent-(j-i+));

            }

        }

    }

    printf("%d\n",ans);

    return ;

}