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.
n = int(input())
m = list(input().replace('',' ').split())
f = list(input().replace('',' ').split())
rul = [0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9]  #0 на 10 позиции 5 на 15 9 на 19
for i in range(len(f)):
    f[i] = int(f[i])
    m[i] = int(m[i])

g1 = 0
g2 = 0
gr = []
gg = []
bst = []
for i in range(len(m)):
    c1 = rul.index(m[i],10,20)
    c2 = rul.index(f[i],10,20)
    for q in range(c1,29):
        if c2 % 10 != rul[q] % 10:
            g1 += 1
        else:
            g1 += 1
            break

    for q in range(c1,0,-1):
        if c2 % 10 != rul[q] % 10:
            g2 += 1
        else:
            g2 += 1
            break
    bst.append(min(g1,g2)-1)
    g1 = 0
    g2 = 0

print(sum(bst))
