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())
l=list(input())
r=list(input())
z=0
t=[]
for i in l:
    if abs(int(i)-int(r[z]))>=6:
        if int(i)>=6:
            d=10-int(i)
            w=d+int(r[z])
            t.append(w)
        else:
            d=int(i)-0
            w=d+10-int(r[z])
            t.append(w)
    else:
        w=abs(int(i)-int(r[z]))
        t.append(w)
    z+=1
print(sum(t))