Lines

Let's define the distance between two strings of equal length, S_A and S_B, as d(S_A, S_B). This distance is calculated as the sum, for each 1 \leq i \leq |S_A|, of the shortest distance between the characters S_A(i) and S_B(i) in a cyclically closed Latin alphabet (that is, after the letter $a$ comes $b$, ..., and after $z$ comes $a$). For example, d(aba, aca) = 1, and d(aba, zbz) = 2.

A cyclic shift of a string $S$ (denoted as S \rightarrow k) is the string S_k S_{k+1} S_{k+2} \ldots S_{|S|} S_1 S_2 \ldots S_{k-1} for some $k$, where $|S|$ is the length of $S$.

The degree of cyclic distance between the strings S_A and S_B (|S_A| = |S_B|) is defined as the sum:

Your task is to calculate the degree of cyclic distance for the given strings S_A and S_B.