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())
f1=str(input())
f2=str(input())
list_n1=list()
list_n2=list()
for x in f1:
    list_n1.append(x)

for y in f2:
    list_n2.append(y)

i=0
sum=0
for i in range(0,n):
    n1=int(list_n1[i])
    n2=int(list_n2[i])
    if n2 > n1 :
        if n2-n1 < (n1+(10-n2)):
            sum=sum+(n2-n1)
        else : 
            sum=sum+(n1+(10-n2))
    elif n1 > n2 :
        if n1-n2 < (n2+(10-n1)):
            sum=sum+n1-n2    
        else :
            sum=sum+(n2+(10-n1))

print(str(sum))