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.
a=int(input())
b=input()
v=input()
p=0
k=0
pk=0
kp=0
pppkk=0
ppkk=0
ppk=0
kkpp=0
kkp=0
for j in range(a):
    bb=b[k]
    vv=v[k]
    bbb=int(bb)
    vvv=int(vv)
    if bbb==vvv:
        p+=0
    if bbb>vvv:
        pk=bbb-vvv
        kp=(vvv+10)-bbb
        kkp=str(kp)
        kkpp=len(kkp)
        ppk=kkpp-1
        ppkk=kkp[ppk]
        pppkk=int(ppkk)
        if pk<pppkk:
            p+=pk
        else:
            p+=pppkk
    if bbb<vvv:
        pk=vvv-bbb
        kp=(10+bbb)-vvv
        if pk<kp:
            p+=pk
        else:
            p+=kp
    k+=1
print(p)