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())
m=list(map(int,input()))
o=list(map(int,input()))

s=[]
def get_shortest_path(current_digit, target_digit):
    clockwise_path = (target_digit - current_digit) % 10
    anticlockwise_path = (current_digit - target_digit) % 10
    if clockwise_path <= anticlockwise_path:
        return clockwise_path, 1
    else:
        return anticlockwise_path, -1

def rotate_wheel(current_digit, target_digit):
    path, direction = get_shortest_path(current_digit, target_digit)

    for i in range(path):
        current_digit = (current_digit + direction) % 10
        s.append(current_digit)

    return current_digit
for i in range(n):
    current_digit = m[i]
    target_digit = o[i]
    new_digit = rotate_wheel(current_digit, target_digit)
print(len(s))
