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.
try:
    n = int(input("What's the number of digits the lock has?"))
    current_number = input(f"Enter a {n} digit number")
    list1 = list(current_number)
    while len(current_number) != n:
        current_number = input(f"Please enter a {n} digit number")
    real_code = input("Enter the real code")
    list2 = list(real_code)
    s = 0
    for i in range(n):
        number_of_moves = abs(int(current_number[i]) - int(real_code[i]))
        if number_of_moves>5:
            x = 9 - number_of_moves
            x = x + 1
            s = s + x
        else:
            s = s + number_of_moves
    print(f"actions {s}")

except ValueError:
    print("Please Only Enter Numbers")
