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 = 0
initial_config = []
goal_config = []


def read_input():
    global n, initial_config, goal_config
    n = int(input())
    initial_config = [int(i) for i in input()]
    goal_config = [int(i) for i in input()]


def solve():
    total_moves = 0

    for i in range(n):
        smaller_digit = min(initial_config[i], goal_config[i])
        bigger_digit = max(initial_config[i], goal_config[i])

        a = smaller_digit + 9 - bigger_digit + 1
        b = bigger_digit - smaller_digit

        # print("a =", a)
        # print("b =", b)

        total_moves = total_moves + min(a, b)
        # print("total_moves =", total_moves)

    return total_moves


read_input()
print(solve())
