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.
def route(source, target, update):
    count = 0
    while source != target:
        source += update
        if source == -1:
            source = 9
        if source == 10:
            source = 0
        count += 1
    return count

n = int(input())
source, target = str(input()), str(input())
count = 0
for j in range(n):
    s, t = ord(source[j]) - 48, ord(target[j]) - 48
    r1, r2 = route(s, t, 1), route(s, t, -1)
    count += min(r1, r2)
print(count)
