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.
from math import fabs

a = int(input())
b = input()
c = input()
b_l = []
c_l = []
for every in list(b):
    b_l.append(every)
for every in list(c):
    c_l.append(every)
count = 0
print(b_l)
print(c_l)
for every in range(0, a):
    fir = fabs(int(b_l[every]) - int(c_l[every]))
    sec = 10 - int(b_l[every]) + int(c_l[every])
    if sec > 10:
        sec = 20 - sec
    if fir < sec:
        count += fir
    else:
        count += sec
print(int(count))
