import sys
def char_dist(a,b):
    d=abs(ord(a)-ord(b))
    return min(d,26-d)

def solve():
    s=input().strip()
    t=input().strip()

    len_s=len(s)
    len_t=len(t)

    min_cost=float('inf')

    for i in range(len_t-len_s+1):
        cost=0
        for j in range(len_s):
            cost+=char_dist(t[i+j],s[j])
            if cost>=min_cost:
                break
        if cost<min_cost:
            min_cost=cost
            if min_cost==0:
                break
    print(min_cost)

if __name__=="__main__":
    solve()