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())
s=input()
n=input()
list1=[]
list2=[]
sum1=0
sum2=0
list3=[]
list4=[]
for x in range(len(s)):
    list1.append(int(s[x]))
    list2.append(int(n[x]))
for x in range(len(s)):
    sum1=10-abs(list1[x]-list2[x])
    sum2=abs(list1[x]-list2[x])
    list3.append(sum1)
    list4.append(sum2)
sum3=0
for x in range(len(s)):
    if list3[x]<=list4[x]:
        sum3+=list3[x]
    else:
        sum3+=list4[x]
print(sum3)