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.
def min_actions_for_digit(digit1, digit2):
    # Функция для вычисления минимального количества действий между двумя цифрами
    return min((digit1 - digit2 + 10) % 10, (digit2 - digit1 + 10) % 10)

def min_actions_for_disk(initial_digit, target_digit):
    # Функция для вычисления минимального количества действий для одного диска
    return min_actions_for_digit(initial_digit, target_digit)

def main():
    n = int(input())
    initial_state = list(map(int, input().strip()))
    target_state = list(map(int, input().strip()))

    total_actions = 0

    for i in range(n):
        total_actions += min_actions_for_disk(initial_state[i], target_state[i])

    print(total_actions)

if __name__ == "__main__":
    main()
