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())
state = list(map(int , input()))
code = list(map(int , input()))
moves = 0
for i in range(n):
    if state[i] == 0:
        state[i] = 10
    if code[i] == 0:
        code[i] = 10
for i in range(n):
    if abs(state[i] - code[i]) <= 5:
        moves += abs(state[i] - code[i])
        #print(1 , moves)
    else:
        if state[i] < 5:
            moves += state[i] + (10 - code[i])
            #print(2 , moves)
        elif state[i] > 5:
            moves += 10 - state[i] + code[i]
            #print(3 , moves)
print(moves)