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.
steps = 0
n = int(input())
OriginalState = input()
Combination = input()

for i in range(0, n):
    if OriginalState[i] == '9' and Combination[i] <= '3':
        steps = steps + 1 + int(Combination[i])
    elif Combination[i] == '9' and OriginalState[i] <= '3':
        steps = steps + 1 + int(OriginalState[i])
    elif OriginalState[i] == '8' and Combination[i] <= '2':
        steps = steps + 2 + int(Combination[i])
    elif Combination[i] == '8' and OriginalState[i] <= '2':
        steps = steps + 2 + int(OriginalState[i])
    elif OriginalState[i] == '7' and Combination[i] <= '1':
        steps = steps + 3 + int(Combination[i])
    elif Combination[i] == '7' and OriginalState[i] <= '1':
        steps = steps + 3 + int(OriginalState[i])
    elif Combination[i] == '6' and OriginalState[i] == '0':
        steps = steps + 4
    elif OriginalState[i] == '6' and Combination[i] == '0':
        steps = steps + 4
    else:
        steps += abs(int(OriginalState[i]) - int(Combination[i]))

print(steps)
