import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String s = in.nextLine().trim(); //避免空格
String t = in.nextLine().trim();
int lenS = s.length();
int lenT = t.length();
List<Integer> totalSteps = new ArrayList<>();//统计列表
//lenT - lenS为了避免t对s进行匹配时超出t的范围
for (int i = 0; i <= lenT - lenS; i++) {
int sum = 0;
for (int k = 0; k < lenS; k++) {
char c1 = s.charAt(k);//获取到字符,然后开始匹配
char c2 = t.charAt(i + k);
int diff = Math.abs(c1 - c2);//计算c1到c2的步数,默认从c1往前到c2
sum += Math.min(diff, 26 - diff);//计算往前往后的步数,然后取之间的最小值,从而最小的到最优步数
}
totalSteps.add(sum);//加入结果
}
int min = Integer.MAX_VALUE;
for (int step : totalSteps) {
if (step < min) {
min = step;//获取列表中的最小值,可以替换为totalsteps.sort((o1 , o2) -> o1 - o2);
}
}
System.out.println(min);//可以替换为totalsteps.get(0);
}
}