Scrooge McDuck keeps his most treasured savings in a home safe with a combination lock. Each time he wants to put there the treasures that he's earned fair and square, he has to open the lock.

The combination lock is represented by *n* rotating disks with digits from 0 to 9 written on them. Scrooge McDuck has to turn some disks so that the combination of digits on the disks forms a secret combination. In one move, he can rotate one disk one digit forwards or backwards. In particular, in one move he can go from digit 0 to digit 9 and vice versa. What minimum number of actions does he need for that?
The first line contains a single integer *n* (1 ≤ *n* ≤ 1000) — the number of disks on the combination lock.

The second line contains a string of *n* digits — the original state of the disks.

The third line contains a string of *n* digits — Scrooge McDuck's combination that opens the lock.
import string


def turn_to_list(s):
    output_list = []
    for i in s:
        output_list.append(i)
    return output_list

def shortest_path(a, b, l):
    index_a = l.index(a)
    index_b = l.index(b)
    path_1 = abs(index_b - index_a)
    if index_b > index_a:
        path_2 = len(l) - index_b + index_a
    else:
        path_2 = len(l) - index_a + index_b
    if path_1 > path_2:
        return path_2
    else:
        return path_1




def main_function():
    lists = ["0", "1", "2", "3", "4", "5", "6", "7", "8", "9"]
    a = input()
    b = input()
    c = input()
    total_move = 0
    for loc in range(len(b)):
        total_move += shortest_path(b[loc], c[loc], lists)
    return total_move


print(main_function())