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())
x=list(input())
y=list(input())
count=0
for i in range(n):
    x[i]=int(x[i])
    y[i]=int(y[i])
    if (x[i]<5 and y[i]>5) or (x[i]>5 and y[i]<5):
        count1=0 
        if x[i]<5:
            while x[i]!=y[i]:
                count1+=1
                x[i]-=1
                x[i]=x[i]%10
        else:
            while x[i]!=y[i]:
                count1+=1
                y[i]-=1
                y[i]=y[i]%10
        count+=count1
    else:
        count+=abs(x[i]-y[i])
print(count)