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.
x=int(input())
y=input()
y_plus=0
y_minus=0
y_copy= [int(w) for w in str(y)]
y_copy2= [int(w) for w in str(y)]
q=input()
q_copy= [int(e) for e in str(q)]
count=0
count_plus=0
count_minus=0
for i in range(x):
    while y_copy[i]!=q_copy[i]:
        y_plus+=1
        y_copy[i]+=1
        if y_copy[i] == 10:
            y_copy[i]=0
        count_plus+=1
    while y_copy2[i]!=q_copy[i]:
        y_minus+=1
        y_copy2[i]-=1
        if y_copy2[i] == -1:
            y_copy2[i]=9
        count_minus+=1
    count+=min(count_minus,count_plus)
    count_minus=0
    count_plus=0
print(count)