import sys

s=input().strip()
t=input().strip()

lens=len(s)
lent=len(t)
min_cost=1000000
for i in range(lent-lens+1):
    #i每个子串开始位置
    current_cost=0
    for j in range(lens):
        dex_s=ord(s[j])-ord("a")
        dex_t=ord(t[j+i])-ord("a")

        chazhi=abs(dex_s-dex_t)
        cost = min(chazhi, 26 - chazhi)
        current_cost+=cost
    if current_cost<min_cost:
        min_cost=current_cost
print(min_cost)