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())
n1=input()
n2=input()
u=0
z='01234567890123456789'
for i in range(n):
    if(n1[i]>n2[i]):
        s=z[int(n2[i]):int(n1[i])]
        x=len(s)
    elif(n1[i]<n2[i]):
        s=z[int(n1[i]):int(n2[i])]
        x=len(s)
    if(int(n2[i])>int(n1[i])):
        v=z[int(n2[i]):]
        b=v.index(n1[i])
        c=v.index(n2[i])
        m=v[c:b]
    else:
        v=z[int(n1[i]):]
        b=v.index(n1[i])
        c=v.index(n2[i])
        m=v[b:c]
    if(len(m)<x):
        u=u+len(m)
    else:
        u=u+x
print(u)
        
