#include<iostream>
using namespace std;
//简单的dp,本来想用一位数组来A的,后来好像内存给的够大,那就开了1000000
char s1[1001],s2[1001];
//int a[1001],b[1001];
int a[1001][1001];
int main()
{
int len1,len2;
int i,j;
int p;
while(scanf("%d %s",&len1,s1)!=EOF)
{
scanf("%d %s",&len2,s2);
for(i=0;i<=len1;i++)
a[i][0]=0;
for(j=0;j<=len2;j++)
a[0][j]=0;
for(i=1;i<=len1;i++)
{
for(j=1;j<=len2;j++)//dp状态方程
{
if(s1[i-1]==s2[j-1])
a[i][j]=a[i-1][j-1]+1;
else
a[i][j]=a[i-1][j]>a[i][j-1]?a[i-1][j]:a[i][j-1];
}
}
p=len1>len2?len1:len2;
printf("%d/n",p-a[len1][len2]);
}
return 0;
}